Base | Representation |
---|---|
bin | 10110110000111100000111… |
… | …101101100000001001100001 |
3 | 111010111101111202020121202111 |
4 | 112300330013231200021201 |
5 | 101110331442133140404 |
6 | 552534313335515321 |
7 | 30042303465302044 |
oct | 2660740755401141 |
9 | 433441452217674 |
10 | 100120112005729 |
11 | 299a0779112912 |
12 | b28bb46b28b41 |
13 | 43b33945b859a |
14 | 1aa1ba6d92c5b |
15 | b895494ec104 |
hex | 5b0f07b60261 |
100120112005729 has 2 divisors, whose sum is σ = 100120112005730. Its totient is φ = 100120112005728.
The previous prime is 100120112005723. The next prime is 100120112005757. The reversal of 100120112005729 is 927500211021001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 100086978905104 + 33133100625 = 10004348^2 + 182025^2 .
It is an emirp because it is prime and its reverse (927500211021001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 100120112005729 - 227 = 100119977788001 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 100120112005729.
It is not a weakly prime, because it can be changed into another prime (100120112005723) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50060056002864 + 50060056002865.
It is an arithmetic number, because the mean of its divisors is an integer number (50060056002865).
Almost surely, 2100120112005729 is an apocalyptic number.
It is an amenable number.
100120112005729 is a deficient number, since it is larger than the sum of its proper divisors (1).
100120112005729 is an equidigital number, since it uses as much as digits as its factorization.
100120112005729 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2520, while the sum is 31.
The spelling of 100120112005729 in words is "one hundred trillion, one hundred twenty billion, one hundred twelve million, five thousand, seven hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •