Base | Representation |
---|---|
bin | 110000000011101000001… |
… | …011001010000110100100 |
3 | 102200201011000220022102201 |
4 | 300003220023022012210 |
5 | 413101334102404104 |
6 | 11005040534344244 |
7 | 460410203611420 |
oct | 60035013120644 |
9 | 12621130808381 |
10 | 3302430122404 |
11 | 10636097899a6 |
12 | 4540491bb084 |
13 | 1ac557c6305a |
14 | b5ba4a99b80 |
15 | 5ad854290a4 |
hex | 300e82ca1a4 |
3302430122404 has 12 divisors (see below), whose sum is σ = 6604860244864. Its totient is φ = 1415327195304.
The previous prime is 3302430122393. The next prime is 3302430122479. The reversal of 3302430122404 is 4042210342033.
3302430122404 is an admirable number.
It is a super-2 number, since 2×33024301224042 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (28), and also a Moran number because the ratio is a prime number: 117943932943 = 3302430122404 / (3 + 3 + 0 + 2 + 4 + 3 + 0 + 1 + 2 + 2 + 4 + 0 + 4).
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 58971966444 + ... + 58971966499.
Almost surely, 23302430122404 is an apocalyptic number.
It is an amenable number.
3302430122404 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3302430122404 is a wasteful number, since it uses less digits than its factorization.
3302430122404 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117943932954 (or 117943932952 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 28.
Adding to 3302430122404 its reverse (4042210342033), we get a palindrome (7344640464437).
The spelling of 3302430122404 in words is "three trillion, three hundred two billion, four hundred thirty million, one hundred twenty-two thousand, four hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •