Base | Representation |
---|---|
bin | 101110101010111000… |
… | …1101010011110110111 |
3 | 100120200201212200201202 |
4 | 1131111301222132313 |
5 | 3120224133031411 |
6 | 114013021443115 |
7 | 10145425152023 |
oct | 1352561523667 |
9 | 316621780652 |
10 | 100223330231 |
11 | 39560503442 |
12 | 1751071049b |
13 | 95b2b74bcb |
14 | 4bca997383 |
15 | 2918b5183b |
hex | 1755c6a7b7 |
100223330231 has 8 divisors (see below), whose sum is σ = 104584802400. Its totient is φ = 95862186112.
The previous prime is 100223330219. The next prime is 100223330237. The reversal of 100223330231 is 132033322001.
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 100223330231 - 26 = 100223330167 is a prime.
It is a super-2 number, since 2×1002233302312 (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 (100223330237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 701795 + ... + 832443.
It is an arithmetic number, because the mean of its divisors is an integer number (13073100300).
Almost surely, 2100223330231 is an apocalyptic number.
100223330231 is a deficient number, since it is larger than the sum of its proper divisors (4361472169).
100223330231 is a wasteful number, since it uses less digits than its factorization.
100223330231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 164025.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 100223330231 its reverse (132033322001), we get a palindrome (232256652232).
The spelling of 100223330231 in words is "one hundred billion, two hundred twenty-three million, three hundred thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •