Base | Representation |
---|---|
bin | 1100010010111000… |
… | …0001111111011000 |
3 | 22112000021202012020 |
4 | 3010232001333120 |
5 | 23224400313422 |
6 | 1303255014440 |
7 | 144533642451 |
oct | 30456017730 |
9 | 8460252166 |
10 | 3300401112 |
11 | 1443a99228 |
12 | 78136a420 |
13 | 4079c2a88 |
14 | 234482128 |
15 | 144b3195c |
hex | c4b81fd8 |
3300401112 has 32 divisors (see below), whose sum is σ = 8517166080. Its totient is φ = 1064645280.
The previous prime is 3300401101. The next prime is 3300401113. The reversal of 3300401112 is 2111040033.
3300401112 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 3300401091 and 3300401100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3300401113) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2217268 + ... + 2218755.
It is an arithmetic number, because the mean of its divisors is an integer number (266161440).
Almost surely, 23300401112 is an apocalyptic number.
It is an amenable number.
3300401112 is an abundant number, since it is smaller than the sum of its proper divisors (5216764968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3300401112 is a wasteful number, since it uses less digits than its factorization.
3300401112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4436063 (or 4436059 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 3300401112 is about 57449.1175911345. The cubic root of 3300401112 is about 1488.8658714972.
Adding to 3300401112 its reverse (2111040033), we get a palindrome (5411441145).
The spelling of 3300401112 in words is "three billion, three hundred million, four hundred one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •