Base | Representation |
---|---|
bin | 101110100100010010… |
… | …1110100110100001111 |
3 | 100120010022122012111012 |
4 | 1131020211310310033 |
5 | 3114301020414043 |
6 | 113535040315435 |
7 | 10140101010035 |
oct | 1351045646417 |
9 | 316108565435 |
10 | 100002123023 |
11 | 39457656170 |
12 | 1746a612b7b |
13 | 95790a3b7a |
14 | 4ba9454555 |
15 | 2904508a18 |
hex | 1748974d0f |
100002123023 has 4 divisors (see below), whose sum is σ = 109093225128. Its totient is φ = 90911020920.
The previous prime is 100002123007. The next prime is 100002123031. The reversal of 100002123023 is 320321200001.
It is a happy number.
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 100002123023 - 24 = 100002123007 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100002122989 and 100002123007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100002123073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4545551036 + ... + 4545551057.
It is an arithmetic number, because the mean of its divisors is an integer number (27273306282).
Almost surely, 2100002123023 is an apocalyptic number.
100002123023 is a deficient number, since it is larger than the sum of its proper divisors (9091102105).
100002123023 is an equidigital number, since it uses as much as digits as its factorization.
100002123023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9091102104.
The product of its (nonzero) digits is 72, while the sum is 14.
Adding to 100002123023 its reverse (320321200001), we get a palindrome (420323323024).
The spelling of 100002123023 in words is "one hundred billion, two million, one hundred twenty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •