Base | Representation |
---|---|
bin | 1011001101001100001010… |
… | …1111110100010110110111 |
3 | 1121121220020221121201012021 |
4 | 2303103002233310112313 |
5 | 3103332341240120210 |
6 | 42112144015134011 |
7 | 2411115436616215 |
oct | 263230257642667 |
9 | 47556227551167 |
10 | 12321233520055 |
11 | 3a20451120a89 |
12 | 146bb30214307 |
13 | 6b4b6c625835 |
14 | 3084cab7dcb5 |
15 | 1657847a7bda |
hex | b34c2bf45b7 |
12321233520055 has 8 divisors (see below), whose sum is σ = 15027865146144. Its totient is φ = 9695396868000.
The previous prime is 12321233519981. The next prime is 12321233520059. The reversal of 12321233520055 is 55002533212321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12321233520055 - 211 = 12321233518007 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12321233520055.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12321233520059) 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, 20198743171 + ... + 20198743780.
It is an arithmetic number, because the mean of its divisors is an integer number (1878483143268).
Almost surely, 212321233520055 is an apocalyptic number.
12321233520055 is a deficient number, since it is larger than the sum of its proper divisors (2706631626089).
12321233520055 is an equidigital number, since it uses as much as digits as its factorization.
12321233520055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40397487017.
The product of its (nonzero) digits is 54000, while the sum is 34.
Adding to 12321233520055 its reverse (55002533212321), we get a palindrome (67323766732376).
The spelling of 12321233520055 in words is "twelve trillion, three hundred twenty-one billion, two hundred thirty-three million, five hundred twenty thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •