Base | Representation |
---|---|
bin | 1001101011011101101101… |
… | …1100011001010000110001 |
3 | 1101200101200021102211221210 |
4 | 2122313123130121100301 |
5 | 2343330430301133001 |
6 | 34345002354310333 |
7 | 2145611334300534 |
oct | 232673334312061 |
9 | 41611607384853 |
10 | 10642315646001 |
11 | 3433420812786 |
12 | 123a675b883a9 |
13 | 5c274882ab00 |
14 | 28b13b322a1b |
15 | 136c6ec09dd6 |
hex | 9addb719431 |
10642315646001 has 12 divisors (see below), whose sum is σ = 15365236791408. Its totient is φ = 6549117320304.
The previous prime is 10642315645847. The next prime is 10642315646029. The reversal of 10642315646001 is 10064651324601.
It is not a de Polignac number, because 10642315646001 - 231 = 10640168162353 is a prime.
It is a super-2 number, since 2×106423156460012 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is not an unprimeable number, because it can be changed into a prime (10642315644001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 10495379815 + ... + 10495380828.
It is an arithmetic number, because the mean of its divisors is an integer number (1280436399284).
Almost surely, 210642315646001 is an apocalyptic number.
It is an amenable number.
10642315646001 is a deficient number, since it is larger than the sum of its proper divisors (4722921145407).
10642315646001 is a wasteful number, since it uses less digits than its factorization.
10642315646001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20990760672 (or 20990760659 counting only the distinct ones).
The product of its (nonzero) digits is 103680, while the sum is 39.
The spelling of 10642315646001 in words is "ten trillion, six hundred forty-two billion, three hundred fifteen million, six hundred forty-six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •