Base | Representation |
---|---|
bin | 1011001000000000100100… |
… | …1000101010000010111011 |
3 | 1121022101111110012122022201 |
4 | 2302000021020222002323 |
5 | 3100403041322421243 |
6 | 42003223201131031 |
7 | 2401514550336064 |
oct | 262001110520273 |
9 | 47271443178281 |
10 | 12232220123323 |
11 | 39967234035a2 |
12 | 1456829929a77 |
13 | 6a965502ca95 |
14 | 304084d0356b |
15 | 1632c4d6304d |
hex | b200922a0bb |
12232220123323 has 8 divisors (see below), whose sum is σ = 12457174185360. Its totient is φ = 12008053992480.
The previous prime is 12232220123317. The next prime is 12232220123339. The reversal of 12232220123323 is 32332102223221.
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 12232220123323 - 213 = 12232220115131 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12232220123291 and 12232220123300.
It is not an unprimeable number, because it can be changed into a prime (12232220123393) 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, 196951465 + ... + 197013562.
It is an arithmetic number, because the mean of its divisors is an integer number (1557146773170).
Almost surely, 212232220123323 is an apocalyptic number.
12232220123323 is a deficient number, since it is larger than the sum of its proper divisors (224954062037).
12232220123323 is an equidigital number, since it uses as much as digits as its factorization.
12232220123323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 393965597.
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 12232220123323 its reverse (32332102223221), we get a palindrome (44564322346544).
The spelling of 12232220123323 in words is "twelve trillion, two hundred thirty-two billion, two hundred twenty million, one hundred twenty-three thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •