Base | Representation |
---|---|
bin | 1011000001100110011000… |
… | …0100101000110110000111 |
3 | 1120220212021200222001011202 |
4 | 2300121212010220312013 |
5 | 3042102040202414343 |
6 | 41440453123253115 |
7 | 2360536122420041 |
oct | 260314604506607 |
9 | 46825250861152 |
10 | 12122110201223 |
11 | 3953a5a205380 |
12 | 143941a21a19b |
13 | 69c157b27119 |
14 | 2dc9db2a8a91 |
15 | 1604cd2a5db8 |
hex | b0666128d87 |
12122110201223 has 16 divisors (see below), whose sum is σ = 13373682850080. Its totient is φ = 10895482752000.
The previous prime is 12122110201219. The next prime is 12122110201277. The reversal of 12122110201223 is 32210201122121.
It is not a de Polignac number, because 12122110201223 - 22 = 12122110201219 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12122110201195 and 12122110201204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12122110201723) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13163711 + ... + 14054447.
It is an arithmetic number, because the mean of its divisors is an integer number (835855178130).
Almost surely, 212122110201223 is an apocalyptic number.
12122110201223 is a deficient number, since it is larger than the sum of its proper divisors (1251572648857).
12122110201223 is a wasteful number, since it uses less digits than its factorization.
12122110201223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 904738.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 12122110201223 its reverse (32210201122121), we get a palindrome (44332311323344).
The spelling of 12122110201223 in words is "twelve trillion, one hundred twenty-two billion, one hundred ten million, two hundred one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •