Base | Representation |
---|---|
bin | 11101101100011110100… |
… | …01101010101011011100 |
3 | 10121112121020012021010020 |
4 | 32312033101222223130 |
5 | 113204044110203200 |
6 | 2100420250112140 |
7 | 133500154410333 |
oct | 16661721525334 |
9 | 3545536167106 |
10 | 1020311022300 |
11 | 363790a77639 |
12 | 1458b011b650 |
13 | 752a423022b |
14 | 37551b70d1a |
15 | 1b81996bea0 |
hex | ed8f46aadc |
1020311022300 has 72 divisors (see below), whose sum is σ = 3053896465200. Its totient is φ = 262700766720.
The previous prime is 1020311022209. The next prime is 1020311022347. The reversal of 1020311022300 is 32201130201.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 1020311022300.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 58629865 + ... + 58647264.
Almost surely, 21020311022300 is an apocalyptic number.
1020311022300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1020311022300 is an abundant number, since it is smaller than the sum of its proper divisors (2033585442900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1020311022300 is a wasteful number, since it uses less digits than its factorization.
1020311022300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117277175 (or 117277168 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 1020311022300 its reverse (32201130201), we get a palindrome (1052512152501).
The spelling of 1020311022300 in words is "one trillion, twenty billion, three hundred eleven million, twenty-two thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •