Base | Representation |
---|---|
bin | 111001010101100101… |
… | …1110111101111000101 |
3 | 102202211012212222100212 |
4 | 1302223023313233011 |
5 | 4004133030200401 |
6 | 132322102445205 |
7 | 11616206040062 |
oct | 1625313675705 |
9 | 382735788325 |
10 | 123131100101 |
11 | 48246328a59 |
12 | 1ba44433805 |
13 | b7c3ab1019 |
14 | 5d61117c69 |
15 | 3309ce3dbb |
hex | 1cab2f7bc5 |
123131100101 has 16 divisors (see below), whose sum is σ = 127866106368. Its totient is φ = 118444420800.
The previous prime is 123131100091. The next prime is 123131100119. The reversal of 123131100101 is 101001131321.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-123131100101 is a prime.
It is a super-2 number, since 2×1231311001012 (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 (123131103101) 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 15 ways as a sum of consecutive naturals, for example, 16363526 + ... + 16371048.
It is an arithmetic number, because the mean of its divisors is an integer number (7991631648).
Almost surely, 2123131100101 is an apocalyptic number.
It is an amenable number.
123131100101 is a deficient number, since it is larger than the sum of its proper divisors (4735006267).
123131100101 is a wasteful number, since it uses less digits than its factorization.
123131100101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10652.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 123131100101 its reverse (101001131321), we get a palindrome (224132231422).
The spelling of 123131100101 in words is "one hundred twenty-three billion, one hundred thirty-one million, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •