Base | Representation |
---|---|
bin | 10110101111101000011000… |
… | …100010110011100010011111 |
3 | 111010011210102122010121122211 |
4 | 112233220120202303202133 |
5 | 101102343322211213043 |
6 | 552425123423421251 |
7 | 30032641415566063 |
oct | 2657503042634237 |
9 | 433153378117584 |
10 | 100030200101023 |
11 | 2996662a1a2055 |
12 | b276633754827 |
13 | 43a7a65acc2ca |
14 | 1a9b6b7a67aa3 |
15 | b87035c72a9d |
hex | 5afa188b389f |
100030200101023 has 4 divisors (see below), whose sum is σ = 102158502230880. Its totient is φ = 97901897971168.
The previous prime is 100030200101017. The next prime is 100030200101033. The reversal of 100030200101023 is 320101002030001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 100030200101023 - 29 = 100030200100511 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100030200100994 and 100030200101012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100030200101033) 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, 1064151064858 + ... + 1064151064951.
It is an arithmetic number, because the mean of its divisors is an integer number (25539625557720).
Almost surely, 2100030200101023 is an apocalyptic number.
100030200101023 is a deficient number, since it is larger than the sum of its proper divisors (2128302129857).
100030200101023 is an equidigital number, since it uses as much as digits as its factorization.
100030200101023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2128302129856.
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 100030200101023 its reverse (320101002030001), we get a palindrome (420131202131024).
The spelling of 100030200101023 in words is "one hundred trillion, thirty billion, two hundred million, one hundred one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •