Base | Representation |
---|---|
bin | 101110100100010001… |
… | …0110000110001010111 |
3 | 100120010021010101222110 |
4 | 1131020202300301113 |
5 | 3114300314220043 |
6 | 113535011202103 |
7 | 10140061123653 |
oct | 1351042606127 |
9 | 316107111873 |
10 | 100001320023 |
11 | 39457157930 |
12 | 1746a2a6333 |
13 | 9578b82517 |
14 | 4ba92c5a63 |
15 | 29043eab33 |
hex | 17488b0c57 |
100001320023 has 128 divisors (see below), whose sum is σ = 157873766400. Its totient is φ = 55729036800.
The previous prime is 100001320021. The next prime is 100001320033. The reversal of 100001320023 is 320023100001.
It is a happy number.
It is not a de Polignac number, because 100001320023 - 21 = 100001320021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100001319990 and 100001320008.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100001320021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 436686873 + ... + 436687101.
It is an arithmetic number, because the mean of its divisors is an integer number (1233388800).
Almost surely, 2100001320023 is an apocalyptic number.
100001320023 is a deficient number, since it is larger than the sum of its proper divisors (57872446377).
100001320023 is a wasteful number, since it uses less digits than its factorization.
100001320023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 533.
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 100001320023 its reverse (320023100001), we get a palindrome (420024420024).
It can be divided in two parts, 100001 and 320023, that multiplied together give a palindrome (32002620023).
The spelling of 100001320023 in words is "one hundred billion, one million, three hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •