Base | Representation |
---|---|
bin | 1001001110010000000011… |
… | …1010000100000000101000 |
3 | 1022220102020012201011000020 |
4 | 2103210000322010000220 |
5 | 2312120101322203012 |
6 | 33322241155440440 |
7 | 2064423245245515 |
oct | 223440072040050 |
9 | 38812205634006 |
10 | 10140433006632 |
11 | 325a596087485 |
12 | 117934a5b6120 |
13 | 587314647456 |
14 | 270b2a07430c |
15 | 128b98b97a8c |
hex | 93900e84028 |
10140433006632 has 64 divisors (see below), whose sum is σ = 26119965456000. Its totient is φ = 3278214109440.
The previous prime is 10140433006607. The next prime is 10140433006679. The reversal of 10140433006632 is 23660033404101.
It is a junction number, because it is equal to n+sod(n) for n = 10140433006593 and 10140433006602.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18083007 + ... + 18635342.
It is an arithmetic number, because the mean of its divisors is an integer number (408124460250).
Almost surely, 210140433006632 is an apocalyptic number.
10140433006632 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10140433006632 is an abundant number, since it is smaller than the sum of its proper divisors (15979532449368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10140433006632 is a wasteful number, since it uses less digits than its factorization.
10140433006632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36718706 (or 36718702 counting only the distinct ones).
The product of its (nonzero) digits is 31104, while the sum is 33.
The spelling of 10140433006632 in words is "ten trillion, one hundred forty billion, four hundred thirty-three million, six thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •