Base | Representation |
---|---|
bin | 1011001100100011011111… |
… | …0001111111001100100011 |
3 | 1121120212001211002011100112 |
4 | 2303020313301333030203 |
5 | 3103143004400333443 |
6 | 42103140155441535 |
7 | 2410251003352052 |
oct | 263106761771443 |
9 | 47525054064315 |
10 | 12310312121123 |
11 | 3a16857299355 |
12 | 14699a27562ab |
13 | 6b3b1ba8b8c3 |
14 | 307b724d0399 |
15 | 165345a92b18 |
hex | b3237c7f323 |
12310312121123 has 8 divisors (see below), whose sum is σ = 12344266440000. Its totient is φ = 12276362887488.
The previous prime is 12310312120999. The next prime is 12310312121167. The reversal of 12310312121123 is 32112121301321.
It is a happy number.
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 12310312121123 - 212 = 12310312117027 is a prime.
It is a super-2 number, since 2×123103121211232 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12310312129123) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3602678 + ... + 6131876.
It is an arithmetic number, because the mean of its divisors is an integer number (1543033305000).
Almost surely, 212310312121123 is an apocalyptic number.
12310312121123 is a deficient number, since it is larger than the sum of its proper divisors (33954318877).
12310312121123 is a wasteful number, since it uses less digits than its factorization.
12310312121123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2542621.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 12310312121123 its reverse (32112121301321), we get a palindrome (44422433422444).
The spelling of 12310312121123 in words is "twelve trillion, three hundred ten billion, three hundred twelve million, one hundred twenty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •