Base | Representation |
---|---|
bin | 1001011001000110010010… |
… | …1001111010100100101111 |
3 | 1100120020020202102210212021 |
4 | 2112101210221322210233 |
5 | 2323143231230322012 |
6 | 33544021210451011 |
7 | 2114041325306500 |
oct | 226214451724457 |
9 | 40506222383767 |
10 | 10326790089007 |
11 | 3321626871747 |
12 | 11a9499133a67 |
13 | 59ba733204b2 |
14 | 279b68270ba7 |
15 | 12d954521007 |
hex | 96464a7a92f |
10326790089007 has 48 divisors (see below), whose sum is σ = 12381326606592. Its totient is φ = 8584432496640.
The previous prime is 10326790088999. The next prime is 10326790089013. The reversal of 10326790089007 is 70098009762301.
10326790089007 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10326790089007 - 23 = 10326790088999 is a prime.
It is a hoax number, since the sum of its digits (52) coincides with the sum of the digits of its distinct prime factors.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10326790089037) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 78626082 + ... + 78757312.
It is an arithmetic number, because the mean of its divisors is an integer number (257944304304).
Almost surely, 210326790089007 is an apocalyptic number.
10326790089007 is a deficient number, since it is larger than the sum of its proper divisors (2054536517585).
10326790089007 is a wasteful number, since it uses less digits than its factorization.
10326790089007 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 131648 (or 131641 counting only the distinct ones).
The product of its (nonzero) digits is 1143072, while the sum is 52.
The spelling of 10326790089007 in words is "ten trillion, three hundred twenty-six billion, seven hundred ninety million, eighty-nine thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •