Base | Representation |
---|---|
bin | 101110100100010010… |
… | …1011100011100111111 |
3 | 100120010022110010121012 |
4 | 1131020211130130333 |
5 | 3114301004220411 |
6 | 113535034225435 |
7 | 10140100113065 |
oct | 1351045343477 |
9 | 316108403535 |
10 | 100002023231 |
11 | 394575981a0 |
12 | 1746a58527b |
13 | 957906a616 |
14 | 4ba942a035 |
15 | 29044d918b |
hex | 174895c73f |
100002023231 has 8 divisors (see below), whose sum is σ = 111151477584. Its totient is φ = 89195629120.
The previous prime is 100002023207. The next prime is 100002023263. The reversal of 100002023231 is 132320200001.
It is a happy number.
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 100002023231 - 226 = 99934914367 is a prime.
It is a super-2 number, since 2×1000020232312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100002023131) 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, 85764446 + ... + 85765611.
It is an arithmetic number, because the mean of its divisors is an integer number (13893934698).
Almost surely, 2100002023231 is an apocalyptic number.
100002023231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
100002023231 is a deficient number, since it is larger than the sum of its proper divisors (11149454353).
100002023231 is a wasteful number, since it uses less digits than its factorization.
100002023231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 171530121.
The product of its (nonzero) digits is 72, while the sum is 14.
Adding to 100002023231 its reverse (132320200001), we get a palindrome (232322223232).
The spelling of 100002023231 in words is "one hundred billion, two million, twenty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •