Base | Representation |
---|---|
bin | 10110101111001100011100… |
… | …100001001101010010110111 |
3 | 111010001221000000110012122210 |
4 | 112233030130201031102313 |
5 | 101101400403204120043 |
6 | 552403243020424503 |
7 | 30030530141242014 |
oct | 2657143441152267 |
9 | 433057000405583 |
10 | 100000202020023 |
11 | 29954936049878 |
12 | b2708613a8133 |
13 | 43a4c94c59816 |
14 | 1a9a06d99c70b |
15 | b8637c3c7633 |
hex | 5af31c84d4b7 |
100000202020023 has 8 divisors (see below), whose sum is σ = 133335759779200. Its totient is φ = 66665722803768.
The previous prime is 100000202020009. The next prime is 100000202020063. The reversal of 100000202020023 is 320020202000001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 100000202020023 - 222 = 100000197825719 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100000202019990 and 100000202020008.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100000202020063) 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, 269419363 + ... + 269790276.
It is an arithmetic number, because the mean of its divisors is an integer number (16666969972400).
Almost surely, 2100000202020023 is an apocalyptic number.
100000202020023 is a deficient number, since it is larger than the sum of its proper divisors (33335557759177).
100000202020023 is an equidigital number, since it uses as much as digits as its factorization.
100000202020023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 539271461.
The product of its (nonzero) digits is 48, while the sum is 12.
Adding to 100000202020023 its reverse (320020202000001), we get a palindrome (420020404020024).
The spelling of 100000202020023 in words is "one hundred trillion, two hundred two million, twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •