Base | Representation |
---|---|
bin | 1001000110001000101010… |
… | …1101010110111010000001 |
3 | 1022102002100122121221110200 |
4 | 2101202022231112322001 |
5 | 2302324032304324301 |
6 | 33134222342315413 |
7 | 2051356242655650 |
oct | 221421255267201 |
9 | 38362318557420 |
10 | 10001011011201 |
11 | 320644aa98771 |
12 | 115631a428b69 |
13 | 57712574c5c2 |
14 | 2680a1505197 |
15 | 125238a9bc86 |
hex | 9188ab56e81 |
10001011011201 has 12 divisors (see below), whose sum is σ = 16509605478912. Its totient is φ = 5714863434936.
The previous prime is 10001011011179. The next prime is 10001011011253. The reversal of 10001011011201 is 10211011010001.
It is not a de Polignac number, because 10001011011201 - 211 = 10001011009153 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10001011011601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 79373103201 + ... + 79373103326.
It is an arithmetic number, because the mean of its divisors is an integer number (1375800456576).
Almost surely, 210001011011201 is an apocalyptic number.
It is an amenable number.
10001011011201 is a deficient number, since it is larger than the sum of its proper divisors (6508594467711).
10001011011201 is a wasteful number, since it uses less digits than its factorization.
10001011011201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 158746206540 (or 158746206537 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 10001011011201 its reverse (10211011010001), we get a palindrome (20212022021202).
The spelling of 10001011011201 in words is "ten trillion, one billion, eleven million, eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •