Base | Representation |
---|---|
bin | 1100000000011101010010… |
… | …0110010110000000010010 |
3 | 1201202002200011121220110000 |
4 | 3000013110212112000102 |
5 | 3212300144314301002 |
6 | 44024525441550430 |
7 | 2531545620454413 |
oct | 300072446260022 |
9 | 51662604556400 |
10 | 13202001322002 |
11 | 422aa34630819 |
12 | 1592777645416 |
13 | 749c357c559c |
14 | 338da1c2780a |
15 | 17d63368061c |
hex | c01d4996012 |
13202001322002 has 20 divisors (see below), whose sum is σ = 29582262221886. Its totient is φ = 4400667107280.
The previous prime is 13202001321973. The next prime is 13202001322021. The reversal of 13202001322002 is 20022310020231.
13202001322002 is a `hidden beast` number, since 1 + 320 + 20 + 0 + 1 + 322 + 0 + 0 + 2 = 666.
It can be written as a sum of positive squares in only one way, i.e., 12894052907241 + 307948414761 = 3590829^2 + 554931^2 .
It is a super-2 number, since 2×132020013220022 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 40746917499 + ... + 40746917822.
Almost surely, 213202001322002 is an apocalyptic number.
13202001322002 is an abundant number, since it is smaller than the sum of its proper divisors (16380260899884).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13202001322002 is an equidigital number, since it uses as much as digits as its factorization.
13202001322002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81493835335 (or 81493835326 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 13202001322002 its reverse (20022310020231), we get a palindrome (33224311342233).
The spelling of 13202001322002 in words is "thirteen trillion, two hundred two billion, one million, three hundred twenty-two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •