Base | Representation |
---|---|
bin | 11101011101110011010… |
… | …11111110001010110000 |
3 | 10120210021011121021121201 |
4 | 32232321223332022300 |
5 | 113041430223020402 |
6 | 2053034412500544 |
7 | 133101011222050 |
oct | 16567153761260 |
9 | 3523234537551 |
10 | 1012432626352 |
11 | 360408907104 |
12 | 14427177a754 |
13 | 74619c56194 |
14 | 370056bd560 |
15 | 1b507e92687 |
hex | ebb9afe2b0 |
1012432626352 has 80 divisors (see below), whose sum is σ = 2285390868480. Its totient is φ = 425474839296.
The previous prime is 1012432626347. The next prime is 1012432626353. The reversal of 1012432626352 is 2536262342101.
It is not an unprimeable number, because it can be changed into a prime (1012432626353) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10774549 + ... + 10868107.
It is an arithmetic number, because the mean of its divisors is an integer number (28567385856).
Almost surely, 21012432626352 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1012432626352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1142695434240).
1012432626352 is an abundant number, since it is smaller than the sum of its proper divisors (1272958242128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1012432626352 is a wasteful number, since it uses less digits than its factorization.
1012432626352 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 95450 (or 95444 counting only the distinct ones).
The product of its (nonzero) digits is 103680, while the sum is 37.
Adding to 1012432626352 its reverse (2536262342101), we get a palindrome (3548694968453).
The spelling of 1012432626352 in words is "one trillion, twelve billion, four hundred thirty-two million, six hundred twenty-six thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •