Base | Representation |
---|---|
bin | 1001001101110001110111… |
… | …1111010111110010000011 |
3 | 1022212122022120100201110001 |
4 | 2103130131333113302003 |
5 | 2312002003214044021 |
6 | 33314421213420431 |
7 | 2064015415326640 |
oct | 223343577276203 |
9 | 38778276321401 |
10 | 10132331003011 |
11 | 325710877a218 |
12 | 117786919a717 |
13 | 586622c3b879 |
14 | 27059c016dc7 |
15 | 12887274e091 |
hex | 9371dfd7c83 |
10132331003011 has 16 divisors (see below), whose sum is σ = 11594303802880. Its totient is φ = 8673984221760.
The previous prime is 10132331003009. The next prime is 10132331003059. The reversal of 10132331003011 is 11030013323101.
It is a cyclic number.
It is not a de Polignac number, because 10132331003011 - 21 = 10132331003009 is a prime.
It is a super-2 number, since 2×101323310030112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10132331003011.
It is not an unprimeable number, because it can be changed into a prime (10132331003111) 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, 74836306 + ... + 74971576.
It is an arithmetic number, because the mean of its divisors is an integer number (724643987680).
Almost surely, 210132331003011 is an apocalyptic number.
10132331003011 is a deficient number, since it is larger than the sum of its proper divisors (1461972799869).
10132331003011 is a wasteful number, since it uses less digits than its factorization.
10132331003011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 148594.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 10132331003011 its reverse (11030013323101), we get a palindrome (21162344326112).
The spelling of 10132331003011 in words is "ten trillion, one hundred thirty-two billion, three hundred thirty-one million, three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •