Base | Representation |
---|---|
bin | 101100000110001101010… |
… | …001110111000010001010 |
3 | 101201200210100212021222010 |
4 | 230012031101313002022 |
5 | 344122044441304002 |
6 | 10240035533440350 |
7 | 431635131546330 |
oct | 54061521670212 |
9 | 11650710767863 |
10 | 3030322213002 |
11 | a69174986147 |
12 | 40b3689400b6 |
13 | 18c9b189c586 |
14 | a6950057b50 |
15 | 53c5b7b846c |
hex | 2c18d47708a |
3030322213002 has 16 divisors (see below), whose sum is σ = 6926450772672. Its totient is φ = 865806346560.
The previous prime is 3030322213001. The next prime is 3030322213007. The reversal of 3030322213002 is 2003122230303.
It is a super-2 number, since 2×30303222130022 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 3030322213002.
It is not an unprimeable number, because it can be changed into a prime (3030322213001) 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, 36075264399 + ... + 36075264482.
It is an arithmetic number, because the mean of its divisors is an integer number (432903173292).
Almost surely, 23030322213002 is an apocalyptic number.
3030322213002 is an abundant number, since it is smaller than the sum of its proper divisors (3896128559670).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3030322213002 is a wasteful number, since it uses less digits than its factorization.
3030322213002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 72150528893.
The product of its (nonzero) digits is 1296, while the sum is 21.
Adding to 3030322213002 its reverse (2003122230303), we get a palindrome (5033444443305).
The spelling of 3030322213002 in words is "three trillion, thirty billion, three hundred twenty-two million, two hundred thirteen thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •