Base | Representation |
---|---|
bin | 11101011101001111010… |
… | …10010100001010111100 |
3 | 10120202111002112112210220 |
4 | 32232213222110022330 |
5 | 113040320312433200 |
6 | 2052544410501340 |
7 | 133060346525220 |
oct | 16564752241274 |
9 | 3522432475726 |
10 | 1012130202300 |
11 | 360273127478 |
12 | 1441a8434850 |
13 | 7459c3b9c39 |
14 | 36db7478780 |
15 | 1b4db6554a0 |
hex | eba7a942bc |
1012130202300 has 72 divisors (see below), whose sum is σ = 3346777209216. Its totient is φ = 231344045760.
The previous prime is 1012130202271. The next prime is 1012130202301. The reversal of 1012130202300 is 32020312101.
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 1012130202300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1012130202301) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 240981282 + ... + 240985481.
Almost surely, 21012130202300 is an apocalyptic number.
1012130202300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1012130202300 is an abundant number, since it is smaller than the sum of its proper divisors (2334647006916).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1012130202300 is a wasteful number, since it uses less digits than its factorization.
1012130202300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 481966787 (or 481966780 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 1012130202300 its reverse (32020312101), we get a palindrome (1044150514401).
The spelling of 1012130202300 in words is "one trillion, twelve billion, one hundred thirty million, two hundred two thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •