Base | Representation |
---|---|
bin | 101110101000001001… |
… | …0010011010111101111 |
3 | 100120110022120011101200 |
4 | 1131100102103113233 |
5 | 3120032043114043 |
6 | 113555531340543 |
7 | 10143226231626 |
oct | 1352022232757 |
9 | 316408504350 |
10 | 100131223023 |
11 | 39513512987 |
12 | 174a58b1753 |
13 | 9599a65ac0 |
14 | 4bbc65c6bd |
15 | 2910a0a7d3 |
hex | 17504935ef |
100131223023 has 24 divisors (see below), whose sum is σ = 155770331808. Its totient is φ = 61615000512.
The previous prime is 100131223013. The next prime is 100131223063. The reversal of 100131223023 is 320322131001.
100131223023 is a `hidden beast` number, since 100 + 1 + 312 + 230 + 23 = 666.
It is not a de Polignac number, because 100131223023 - 212 = 100131218927 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 100131222987 and 100131223005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100131223013) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3330886 + ... + 3360812.
It is an arithmetic number, because the mean of its divisors is an integer number (6490430492).
Almost surely, 2100131223023 is an apocalyptic number.
100131223023 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
100131223023 is a deficient number, since it is larger than the sum of its proper divisors (55639108785).
100131223023 is a wasteful number, since it uses less digits than its factorization.
100131223023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 58543 (or 58540 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 100131223023 its reverse (320322131001), we get a palindrome (420453354024).
The spelling of 100131223023 in words is "one hundred billion, one hundred thirty-one million, two hundred twenty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •