Base | Representation |
---|---|
bin | 10110110010001111110110… |
… | …101010000101010110011001 |
3 | 111010210222120121101121220201 |
4 | 112302033312222011112121 |
5 | 101113320110133210243 |
6 | 553043503040422201 |
7 | 30051635501363554 |
oct | 2662176652052631 |
9 | 433728517347821 |
10 | 100210020210073 |
11 | 29a25915a36524 |
12 | b2a5459017961 |
13 | 43bb9c23aa4b7 |
14 | 1aa62959d769b |
15 | b8ba5c79504d |
hex | 5b23f6a85599 |
100210020210073 has 2 divisors, whose sum is σ = 100210020210074. Its totient is φ = 100210020210072.
The previous prime is 100210020210061. The next prime is 100210020210101. The reversal of 100210020210073 is 370012020012001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 92276542420624 + 7933477789449 = 9606068^2 + 2816643^2 .
It is a cyclic number.
It is not a de Polignac number, because 100210020210073 - 221 = 100210018112921 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 100210020210073.
It is not a weakly prime, because it can be changed into another prime (100210020210673) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50105010105036 + 50105010105037.
It is an arithmetic number, because the mean of its divisors is an integer number (50105010105037).
Almost surely, 2100210020210073 is an apocalyptic number.
It is an amenable number.
100210020210073 is a deficient number, since it is larger than the sum of its proper divisors (1).
100210020210073 is an equidigital number, since it uses as much as digits as its factorization.
100210020210073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 168, while the sum is 19.
Adding to 100210020210073 its reverse (370012020012001), we get a palindrome (470222040222074).
The spelling of 100210020210073 in words is "one hundred trillion, two hundred ten billion, twenty million, two hundred ten thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •