Base | Representation |
---|---|
bin | 10001100111000001010… |
… | …111101011111110011100 |
3 | 11021200120001010120011120 |
4 | 101213001113223332130 |
5 | 124311321241203200 |
6 | 2323532010050540 |
7 | 153300102320523 |
oct | 21470127537634 |
9 | 4250501116146 |
10 | 1210130022300 |
11 | 427238938851 |
12 | 176646119a50 |
13 | 8a1651cab44 |
14 | 427dba554ba |
15 | 217291cd9a0 |
hex | 119c15ebf9c |
1210130022300 has 72 divisors (see below), whose sum is σ = 3502662075696. Its totient is φ = 322576680960.
The previous prime is 1210130022293. The next prime is 1210130022313. The reversal of 1210130022300 is 32200310121.
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 1210130022300.
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, 82 + ... + 1555718.
Almost surely, 21210130022300 is an apocalyptic number.
1210130022300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1210130022300 is an abundant number, since it is smaller than the sum of its proper divisors (2292532053396).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1210130022300 is a wasteful number, since it uses less digits than its factorization.
1210130022300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1558247 (or 1558240 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 1210130022300 its reverse (32200310121), we get a palindrome (1242330332421).
The spelling of 1210130022300 in words is "one trillion, two hundred ten billion, one hundred thirty million, twenty-two thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.369 sec. • engine limits •