Base | Representation |
---|---|
bin | 10110111101110001101111… |
… | …100110100001101100100001 |
3 | 111020121201122120102222121110 |
4 | 112331301233212201230201 |
5 | 101214310224231200301 |
6 | 554451454325413533 |
7 | 30163114504510065 |
oct | 2675615746415441 |
9 | 436551576388543 |
10 | 101002323303201 |
11 | 2a20093241a161 |
12 | b3b2b1586a2a9 |
13 | 444862a8556b8 |
14 | 1ad2777a31aa5 |
15 | ba247eeac0d6 |
hex | 5bdc6f9a1b21 |
101002323303201 has 4 divisors (see below), whose sum is σ = 134669764404272. Its totient is φ = 67334882202132.
The previous prime is 101002323303173. The next prime is 101002323303209. The reversal of 101002323303201 is 102303323200101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 101002323303201 - 29 = 101002323302689 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101002323303209) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16833720550531 + ... + 16833720550536.
It is an arithmetic number, because the mean of its divisors is an integer number (33667441101068).
Almost surely, 2101002323303201 is an apocalyptic number.
It is an amenable number.
101002323303201 is a deficient number, since it is larger than the sum of its proper divisors (33667441101071).
101002323303201 is an equidigital number, since it uses as much as digits as its factorization.
101002323303201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33667441101070.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 101002323303201 its reverse (102303323200101), we get a palindrome (203305646503302).
The spelling of 101002323303201 in words is "one hundred one trillion, two billion, three hundred twenty-three million, three hundred three thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •