Base | Representation |
---|---|
bin | 1100000110010001110011… |
… | …1111110111101101101001 |
3 | 1202002122210021012022110002 |
4 | 3001210130333313231221 |
5 | 3220414444024033113 |
6 | 44142504325232345 |
7 | 2542015652206166 |
oct | 301443477675551 |
9 | 52078707168402 |
10 | 13302000221033 |
11 | 426938a384727 |
12 | 15aa024b626b5 |
13 | 7564b100ab64 |
14 | 33db6aa7d06d |
15 | 18103774dc58 |
hex | c191cff7b69 |
13302000221033 has 8 divisors (see below), whose sum is σ = 13335328384896. Its totient is φ = 13268713590000.
The previous prime is 13302000221023. The next prime is 13302000221047. The reversal of 13302000221033 is 33012200020331.
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 13302000221033 - 216 = 13302000155497 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 13302000220996 and 13302000221014.
It is not an unprimeable number, because it can be changed into a prime (13302000221023) 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, 9741803 + ... + 11023008.
It is an arithmetic number, because the mean of its divisors is an integer number (1666916048112).
Almost surely, 213302000221033 is an apocalyptic number.
It is an amenable number.
13302000221033 is a deficient number, since it is larger than the sum of its proper divisors (33328163863).
13302000221033 is an equidigital number, since it uses as much as digits as its factorization.
13302000221033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20766415.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 13302000221033 its reverse (33012200020331), we get a palindrome (46314200241364).
The spelling of 13302000221033 in words is "thirteen trillion, three hundred two billion, two hundred twenty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •