Base | Representation |
---|---|
bin | 10110111101111001110100… |
… | …111010010110010101001011 |
3 | 111020122120001102112201201121 |
4 | 112331321310322112111023 |
5 | 101214431013043221303 |
6 | 554455451443100111 |
7 | 30163542542106463 |
oct | 2675716472262513 |
9 | 436576042481647 |
10 | 101011002320203 |
11 | 2a204586505088 |
12 | b3b4738371637 |
13 | 44493b196c211 |
14 | 1ad2d5c570ba3 |
15 | ba27dbdd29bd |
hex | 5bde74e9654b |
101011002320203 has 8 divisors (see below), whose sum is σ = 102667864106480. Its totient is φ = 99354170976480.
The previous prime is 101011002320101. The next prime is 101011002320209. The reversal of 101011002320203 is 302023200110101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101011002320203 - 217 = 101011002189131 is a prime.
It is a super-2 number, since 2×1010110023202032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101011002320209) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 871500 + ... + 14240137.
It is an arithmetic number, because the mean of its divisors is an integer number (12833483013310).
Almost surely, 2101011002320203 is an apocalyptic number.
101011002320203 is a deficient number, since it is larger than the sum of its proper divisors (1656861786277).
101011002320203 is a wasteful number, since it uses less digits than its factorization.
101011002320203 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15221277.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 101011002320203 its reverse (302023200110101), we get a palindrome (403034202430304).
The spelling of 101011002320203 in words is "one hundred one trillion, eleven billion, two million, three hundred twenty thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •