Base | Representation |
---|---|
bin | 1010111011101110100010… |
… | …1111101110110111001001 |
3 | 1120120012212201111112000121 |
4 | 2232323220233232313021 |
5 | 3033423431132233113 |
6 | 41322250155303241 |
7 | 2350335056165023 |
oct | 256735057566711 |
9 | 46505781445017 |
10 | 12021223321033 |
11 | 3915199199043 |
12 | 142196344ab21 |
13 | 69279a665904 |
14 | 2d7b8a545013 |
15 | 15ca76281e8d |
hex | aeee8beedc9 |
12021223321033 has 8 divisors (see below), whose sum is σ = 12025705644288. Its totient is φ = 12016741621104.
The previous prime is 12021223320973. The next prime is 12021223321039. The reversal of 12021223321033 is 33012332212021.
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 12021223321033 - 29 = 12021223320521 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12021223320989 and 12021223321007.
It is not an unprimeable number, because it can be changed into a prime (12021223321039) 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, 40369035 + ... + 40665727.
It is an arithmetic number, because the mean of its divisors is an integer number (1503213205536).
Almost surely, 212021223321033 is an apocalyptic number.
It is an amenable number.
12021223321033 is a deficient number, since it is larger than the sum of its proper divisors (4482323255).
12021223321033 is a wasteful number, since it uses less digits than its factorization.
12021223321033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 311663.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 12021223321033 its reverse (33012332212021), we get a palindrome (45033555533054).
The spelling of 12021223321033 in words is "twelve trillion, twenty-one billion, two hundred twenty-three million, three hundred twenty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •