Base | Representation |
---|---|
bin | 100010001000010000100010… |
… | …1100011010111101001001010 |
3 | 1110100221001100112211201112220 |
4 | 1010100201011203113221022 |
5 | 303322003101430133002 |
6 | 2542250553125514510 |
7 | 120142615253004660 |
oct | 10420410543275112 |
9 | 1410831315751486 |
10 | 300202201021002 |
11 | 87721047248345 |
12 | 29805245872a36 |
13 | cb67c3b722287 |
14 | 541bc14d7cc30 |
15 | 24a8e351527bc |
hex | 11108458d7a4a |
300202201021002 has 32 divisors (see below), whose sum is σ = 687608978227200. Its totient is φ = 85592992590768.
The previous prime is 300202201021001. The next prime is 300202201021027. The reversal of 300202201021002 is 200120102202003.
It is a happy number.
It is a super-2 number, since 2×3002022010210022 (a number of 30 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (300202201021001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7461014802 + ... + 7461055037.
It is an arithmetic number, because the mean of its divisors is an integer number (21487780569600).
Almost surely, 2300202201021002 is an apocalyptic number.
300202201021002 is an abundant number, since it is smaller than the sum of its proper divisors (387406777206198).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
300202201021002 is a wasteful number, since it uses less digits than its factorization.
300202201021002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14922070330.
The product of its (nonzero) digits is 96, while the sum is 15.
Adding to 300202201021002 its reverse (200120102202003), we get a palindrome (500322303223005).
The spelling of 300202201021002 in words is "three hundred trillion, two hundred two billion, two hundred one million, twenty-one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •