Base | Representation |
---|---|
bin | 1010111100011011001101… |
… | …1000110110011110001001 |
3 | 1120121100211022020221220221 |
4 | 2233012303120312132021 |
5 | 3034123010014013304 |
6 | 41331552020350041 |
7 | 2351241144100366 |
oct | 257066330663611 |
9 | 46540738227827 |
10 | 12033213032329 |
11 | 391a291062655 |
12 | 142414a845321 |
13 | 69395b637338 |
14 | 2d85a6a4546d |
15 | 15d028b6e054 |
hex | af1b3636789 |
12033213032329 has 8 divisors (see below), whose sum is σ = 12038531762880. Its totient is φ = 12027895328400.
The previous prime is 12033213032317. The next prime is 12033213032363. The reversal of 12033213032329 is 92323031233021.
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 12033213032329 - 211 = 12033213030281 is a prime.
It is a super-3 number, since 3×120332130323293 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12033213032294 and 12033213032303.
It is not an unprimeable number, because it can be changed into a prime (12033213032389) 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, 23681919 + ... + 24184699.
It is an arithmetic number, because the mean of its divisors is an integer number (1504816470360).
Almost surely, 212033213032329 is an apocalyptic number.
It is an amenable number.
12033213032329 is a deficient number, since it is larger than the sum of its proper divisors (5318730551).
12033213032329 is an equidigital number, since it uses as much as digits as its factorization.
12033213032329 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 513311.
The product of its (nonzero) digits is 34992, while the sum is 34.
The spelling of 12033213032329 in words is "twelve trillion, thirty-three billion, two hundred thirteen million, thirty-two thousand, three hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •