Base | Representation |
---|---|
bin | 10111000000101010110001… |
… | …110001101011110011101001 |
3 | 111021022201110211111112101201 |
4 | 113000222301301223303221 |
5 | 101231034123004120243 |
6 | 555123033140044201 |
7 | 30213350112651514 |
oct | 2700526161536351 |
9 | 437281424445351 |
10 | 101201002020073 |
11 | 2a27811637682a |
12 | b425522993661 |
13 | 44612a11c7427 |
14 | 1adc224451d7b |
15 | ba770c43a04d |
hex | 5c0ab1c6bce9 |
101201002020073 has 2 divisors, whose sum is σ = 101201002020074. Its totient is φ = 101201002020072.
The previous prime is 101201002020023. The next prime is 101201002020137. The reversal of 101201002020073 is 370020200102101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 100787203154089 + 413798865984 = 10039283^2 + 643272^2 .
It is a cyclic number.
It is not a de Polignac number, because 101201002020073 - 221 = 101200999922921 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101201002020073.
It is not a weakly prime, because it can be changed into another prime (101201002020023) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50600501010036 + 50600501010037.
It is an arithmetic number, because the mean of its divisors is an integer number (50600501010037).
Almost surely, 2101201002020073 is an apocalyptic number.
It is an amenable number.
101201002020073 is a deficient number, since it is larger than the sum of its proper divisors (1).
101201002020073 is an equidigital number, since it uses as much as digits as its factorization.
101201002020073 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 168, while the sum is 19.
Adding to 101201002020073 its reverse (370020200102101), we get a palindrome (471221202122174).
The spelling of 101201002020073 in words is "one hundred one trillion, two hundred one billion, two million, twenty thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •