Base | Representation |
---|---|
bin | 11101111110111001101… |
… | …01111001011100101000 |
3 | 10122111010120101020120011 |
4 | 32333130311321130220 |
5 | 113334323242101300 |
6 | 2105133550341304 |
7 | 134300242032253 |
oct | 16773465713450 |
9 | 3574116336504 |
10 | 1030202300200 |
11 | 3679a7383077 |
12 | 1477b07ba834 |
13 | 761bc541ba8 |
14 | 37c0d6b209a |
15 | 1bbe8000eba |
hex | efdcd79728 |
1030202300200 has 24 divisors (see below), whose sum is σ = 2395220348430. Its totient is φ = 412080920000.
The previous prime is 1030202300191. The next prime is 1030202300201. The reversal of 1030202300200 is 20032020301.
It is a happy number.
It can be written as a sum of positive squares in 3 ways, for example, as 921765127396 + 108437172804 = 960086^2 + 329298^2 .
It is a super-2 number, since 2×10302023002002 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1030202300201) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2575505551 + ... + 2575505950.
Almost surely, 21030202300200 is an apocalyptic number.
1030202300200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1030202300200 is an abundant number, since it is smaller than the sum of its proper divisors (1365018048230).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1030202300200 is a wasteful number, since it uses less digits than its factorization.
1030202300200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5151011517 (or 5151011508 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 13.
Adding to 1030202300200 its reverse (20032020301), we get a palindrome (1050234320501).
The spelling of 1030202300200 in words is "one trillion, thirty billion, two hundred two million, three hundred thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •