Base | Representation |
---|---|
bin | 101110101000011110… |
… | …0101001010101010111 |
3 | 100120111002110002202002 |
4 | 1131100330221111113 |
5 | 3120042413314111 |
6 | 114001005305515 |
7 | 10143422462312 |
oct | 1352074512527 |
9 | 316432402662 |
10 | 100142323031 |
11 | 39519804543 |
12 | 174a956529b |
13 | 959c15125a |
14 | 4bbdd0b979 |
15 | 291199e63b |
hex | 1750f29557 |
100142323031 has 8 divisors (see below), whose sum is σ = 101877768960. Its totient is φ = 98408147832.
The previous prime is 100142322967. The next prime is 100142323033. The reversal of 100142323031 is 130323241001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 100142323031 - 26 = 100142322967 is a prime.
It is a super-2 number, since 2×1001423230312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100142322994 and 100142323012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100142323033) 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, 158015 + ... + 474608.
It is an arithmetic number, because the mean of its divisors is an integer number (12734721120).
Almost surely, 2100142323031 is an apocalyptic number.
100142323031 is a deficient number, since it is larger than the sum of its proper divisors (1735445929).
100142323031 is an equidigital number, since it uses as much as digits as its factorization.
100142323031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 635365.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 100142323031 its reverse (130323241001), we get a palindrome (230465564032).
The spelling of 100142323031 in words is "one hundred billion, one hundred forty-two million, three hundred twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •