Base | Representation |
---|---|
bin | 10110100100111100… |
… | …10101001101000011 |
3 | 1011021201222201212020 |
4 | 23102132111031003 |
5 | 144311000213443 |
6 | 5322433132523 |
7 | 606241442145 |
oct | 132236251503 |
9 | 34251881766 |
10 | 12121101123 |
11 | 516005574a |
12 | 24233ba143 |
13 | 11b22859b1 |
14 | 82db42c95 |
15 | 4ae1e2583 |
hex | 2d2795343 |
12121101123 has 8 divisors (see below), whose sum is σ = 16163910336. Its totient is φ = 8079513000.
The previous prime is 12121101101. The next prime is 12121101191. The reversal of 12121101123 is 32110112121.
12121101123 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12121101123 - 29 = 12121100611 is a prime.
It is a super-2 number, since 2×121211011232 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (32121101123) 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 7 ways as a sum of consecutive naturals, for example, 281853 + ... + 321998.
It is an arithmetic number, because the mean of its divisors is an integer number (2020488792).
Almost surely, 212121101123 is an apocalyptic number.
12121101123 is a deficient number, since it is larger than the sum of its proper divisors (4042809213).
12121101123 is an equidigital number, since it uses as much as digits as its factorization.
12121101123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 610545.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 12121101123 its reverse (32110112121), we get a palindrome (44231213244).
The spelling of 12121101123 in words is "twelve billion, one hundred twenty-one million, one hundred one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •