Base | Representation |
---|---|
bin | 101111001000100110… |
… | …0001010010100011011 |
3 | 100200021012112110212100 |
4 | 1132101030022110123 |
5 | 3124244323211443 |
6 | 114255550414443 |
7 | 10212220633005 |
oct | 1362114122433 |
9 | 320235473770 |
10 | 101220132123 |
11 | 39a22142460 |
12 | 1774a501423 |
13 | 9711532506 |
14 | 4c83111375 |
15 | 29764003d3 |
hex | 179130a51b |
101220132123 has 48 divisors (see below), whose sum is σ = 172808228736. Its totient is φ = 56394213120.
The previous prime is 101220132109. The next prime is 101220132131. The reversal of 101220132123 is 321231022101.
101220132123 is a `hidden beast` number, since 101 + 220 + 1 + 321 + 23 = 666.
It is not a de Polignac number, because 101220132123 - 212 = 101220128027 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101220132096 and 101220132105.
It is not an unprimeable number, because it can be changed into a prime (101220132133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 626965 + ... + 771702.
It is an arithmetic number, because the mean of its divisors is an integer number (3600171432).
Almost surely, 2101220132123 is an apocalyptic number.
101220132123 is a deficient number, since it is larger than the sum of its proper divisors (71588096613).
101220132123 is a wasteful number, since it uses less digits than its factorization.
101220132123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1398744 (or 1398741 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 101220132123 its reverse (321231022101), we get a palindrome (422451154224).
The spelling of 101220132123 in words is "one hundred one billion, two hundred twenty million, one hundred thirty-two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •