Base | Representation |
---|---|
bin | 1001011000110000101110… |
… | …1101111101101111000100 |
3 | 1100112200022110000210021020 |
4 | 2112030023231331233010 |
5 | 2323044403232323022 |
6 | 33541223041351140 |
7 | 2113445035045131 |
oct | 226141355755704 |
9 | 40480273023236 |
10 | 10321003011012 |
11 | 331a12714a361 |
12 | 11a83430384b0 |
13 | 59b3603b45a5 |
14 | 279779849588 |
15 | 12d71644635c |
hex | 9630bb7dbc4 |
10321003011012 has 48 divisors (see below), whose sum is σ = 24208256022720. Its totient is φ = 3422390424192.
The previous prime is 10321003011001. The next prime is 10321003011017. The reversal of 10321003011012 is 21011030012301.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 10321003010982 and 10321003011000.
It is not an unprimeable number, because it can be changed into a prime (10321003011017) 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, 876883 + ... + 4627194.
It is an arithmetic number, because the mean of its divisors is an integer number (504338667140).
Almost surely, 210321003011012 is an apocalyptic number.
10321003011012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10321003011012 is an abundant number, since it is smaller than the sum of its proper divisors (13887253011708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10321003011012 is a wasteful number, since it uses less digits than its factorization.
10321003011012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5504900 (or 5504898 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 10321003011012 its reverse (21011030012301), we get a palindrome (31332033023313).
The spelling of 10321003011012 in words is "ten trillion, three hundred twenty-one billion, three million, eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •