Base | Representation |
---|---|
bin | 1011000001101010100001… |
… | …0111000010011111001101 |
3 | 1120220222011012121120211212 |
4 | 2300122220113002133031 |
5 | 3042111324403233401 |
6 | 41441155332024205 |
7 | 2360605515322043 |
oct | 260325027023715 |
9 | 46828135546755 |
10 | 12123222321101 |
11 | 395447aa48511 |
12 | 143968a762065 |
13 | 69c2a435c518 |
14 | 2dcaa4c80393 |
15 | 160545c32dbb |
hex | b06a85c27cd |
12123222321101 has 4 divisors (see below), whose sum is σ = 12132526407072. Its totient is φ = 12113918235132.
The previous prime is 12123222321097. The next prime is 12123222321113. The reversal of 12123222321101 is 10112322232121.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 12123222321101 - 22 = 12123222321097 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12123222321151) 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, 4652041031 + ... + 4652043636.
It is an arithmetic number, because the mean of its divisors is an integer number (3033131601768).
Almost surely, 212123222321101 is an apocalyptic number.
It is an amenable number.
12123222321101 is a deficient number, since it is larger than the sum of its proper divisors (9304085971).
12123222321101 is an equidigital number, since it uses as much as digits as its factorization.
12123222321101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9304085970.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 12123222321101 its reverse (10112322232121), we get a palindrome (22235544553222).
The spelling of 12123222321101 in words is "twelve trillion, one hundred twenty-three billion, two hundred twenty-two million, three hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.318 sec. • engine limits •