Base | Representation |
---|---|
bin | 10001100111010011010… |
… | …000011100100111111100 |
3 | 11021201022221210211000002 |
4 | 101213103100130213330 |
5 | 124312430102124200 |
6 | 2324021450053432 |
7 | 153310405132361 |
oct | 21472320344774 |
9 | 4251287724002 |
10 | 1210430114300 |
11 | 427382275370 |
12 | 17670a71a278 |
13 | 8a1b242b784 |
14 | 42829850468 |
15 | 21745709bd5 |
hex | 119d341c9fc |
1210430114300 has 72 divisors (see below), whose sum is σ = 2865709832832. Its totient is φ = 440111608000.
The previous prime is 1210430114273. The next prime is 1210430114329. The reversal of 1210430114300 is 34110340121.
It is a super-2 number, since 2×12104301143002 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 11920745 + ... + 12021855.
It is an arithmetic number, because the mean of its divisors is an integer number (39801525456).
Almost surely, 21210430114300 is an apocalyptic number.
1210430114300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1210430114300 is an abundant number, since it is smaller than the sum of its proper divisors (1655279718532).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1210430114300 is a wasteful number, since it uses less digits than its factorization.
1210430114300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112019 (or 112012 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 1210430114300 its reverse (34110340121), we get a palindrome (1244540454421).
The spelling of 1210430114300 in words is "one trillion, two hundred ten billion, four hundred thirty million, one hundred fourteen thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •