Base | Representation |
---|---|
bin | 1011001101001011011010… |
… | …1001011000000001010010 |
3 | 1121121212201210121110020202 |
4 | 2303102312221120001102 |
5 | 3103331432302121110 |
6 | 42112111523535202 |
7 | 2411110423202216 |
oct | 263226651300122 |
9 | 47555653543222 |
10 | 12321030504530 |
11 | 3a20357569460 |
12 | 146ba9422a502 |
13 | 6b4b39553ac7 |
14 | 3084abc14946 |
15 | 165771a550a5 |
hex | b34b6a58052 |
12321030504530 has 32 divisors (see below), whose sum is σ = 24194244853440. Its totient is φ = 4480333744320.
The previous prime is 12321030504487. The next prime is 12321030504581. The reversal of 12321030504530 is 3540503012321.
It is a happy number.
It is a super-3 number, since 3×123210305045303 (a number of 40 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12321030504493 and 12321030504502.
It is an unprimeable number.
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, 13237097 + ... + 14137283.
It is an arithmetic number, because the mean of its divisors is an integer number (756070151670).
Almost surely, 212321030504530 is an apocalyptic number.
12321030504530 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12321030504530 is a deficient number, since it is larger than the sum of its proper divisors (11873214348910).
12321030504530 is a wasteful number, since it uses less digits than its factorization.
12321030504530 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1024634.
The product of its (nonzero) digits is 10800, while the sum is 29.
Adding to 12321030504530 its reverse (3540503012321), we get a palindrome (15861533516851).
The spelling of 12321030504530 in words is "twelve trillion, three hundred twenty-one billion, thirty million, five hundred four thousand, five hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •