Base | Representation |
---|---|
bin | 10110111101110001101000… |
… | …010000111011011101001101 |
3 | 111020121201022222210202012001 |
4 | 112331301220100323131031 |
5 | 101214310001222413122 |
6 | 554451434211112301 |
7 | 30163111451245462 |
oct | 2675615020733515 |
9 | 436551288722161 |
10 | 101002200201037 |
11 | 2a200879989733 |
12 | b3b2aa05a2691 |
13 | 444860b1b3795 |
14 | 1ad2765549669 |
15 | ba2474292527 |
hex | 5bdc6843b74d |
101002200201037 has 2 divisors, whose sum is σ = 101002200201038. Its totient is φ = 101002200201036.
The previous prime is 101002200200987. The next prime is 101002200201061. The reversal of 101002200201037 is 730102002200101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 79791146242921 + 21211053958116 = 8932589^2 + 4605546^2 .
It is an emirp because it is prime and its reverse (730102002200101) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101002200201037 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101002200201137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50501100100518 + 50501100100519.
It is an arithmetic number, because the mean of its divisors is an integer number (50501100100519).
Almost surely, 2101002200201037 is an apocalyptic number.
It is an amenable number.
101002200201037 is a deficient number, since it is larger than the sum of its proper divisors (1).
101002200201037 is an equidigital number, since it uses as much as digits as its factorization.
101002200201037 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 101002200201037 its reverse (730102002200101), we get a palindrome (831104202401138).
The spelling of 101002200201037 in words is "one hundred one trillion, two billion, two hundred million, two hundred one thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •