Base | Representation |
---|---|
bin | 101110101010110010… |
… | …1101110100100001111 |
3 | 100120200111222201112212 |
4 | 1131111211232210033 |
5 | 3120222332414411 |
6 | 114012430421035 |
7 | 10145356440413 |
oct | 1352545564417 |
9 | 316614881485 |
10 | 100220201231 |
11 | 39559766597 |
12 | 1750b66177b |
13 | 95b231a927 |
14 | 4bca3c0d43 |
15 | 291873468b |
hex | 175596e90f |
100220201231 has 4 divisors (see below), whose sum is σ = 100352593272. Its totient is φ = 100087809192.
The previous prime is 100220201209. The next prime is 100220201243. The reversal of 100220201231 is 132102022001.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 132102022001 = 139 ⋅950374259.
It is a cyclic number.
It is not a de Polignac number, because 100220201231 - 226 = 100153092367 is a prime.
It is a super-2 number, since 2×1002202012312 (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 (100220201251) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 66194885 + ... + 66196398.
It is an arithmetic number, because the mean of its divisors is an integer number (25088148318).
Almost surely, 2100220201231 is an apocalyptic number.
100220201231 is a deficient number, since it is larger than the sum of its proper divisors (132392041).
100220201231 is an equidigital number, since it uses as much as digits as its factorization.
100220201231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132392040.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 100220201231 its reverse (132102022001), we get a palindrome (232322223232).
The spelling of 100220201231 in words is "one hundred billion, two hundred twenty million, two hundred one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •