Base | Representation |
---|---|
bin | 1011001101001000000001… |
… | …1001010011000000100001 |
3 | 1121121210101100221021211211 |
4 | 2303102000121103000201 |
5 | 3103323101300220113 |
6 | 42111441331310121 |
7 | 2411046031565131 |
oct | 263220031230041 |
9 | 47553340837754 |
10 | 12320120320033 |
11 | 3a1aa2a810369 |
12 | 146b87b44b341 |
13 | 6b4a22b028b6 |
14 | 308422da6ac1 |
15 | 16571bbb5b3d |
hex | b3480653021 |
12320120320033 has 16 divisors (see below), whose sum is σ = 12783133843200. Its totient is φ = 11864911893120.
The previous prime is 12320120320009. The next prime is 12320120320049. The reversal of 12320120320033 is 33002302102321.
It is a cyclic number.
It is not a de Polignac number, because 12320120320033 - 213 = 12320120311841 is a prime.
It is a super-2 number, since 2×123201203200332 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12320120319986 and 12320120320013.
It is not an unprimeable number, because it can be changed into a prime (12320120320933) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 14629063 + ... + 15448291.
It is an arithmetic number, because the mean of its divisors is an integer number (798945865200).
Almost surely, 212320120320033 is an apocalyptic number.
It is an amenable number.
12320120320033 is a deficient number, since it is larger than the sum of its proper divisors (463013523167).
12320120320033 is an equidigital number, since it uses as much as digits as its factorization.
12320120320033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 823992.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 12320120320033 its reverse (33002302102321), we get a palindrome (45322422422354).
The spelling of 12320120320033 in words is "twelve trillion, three hundred twenty billion, one hundred twenty million, three hundred twenty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •