Base | Representation |
---|---|
bin | 10100100001010110011… |
… | …110000101011000000000 |
3 | 11222210222021002111000122 |
4 | 110201112132011120000 |
5 | 141101042200000000 |
6 | 2555500440035412 |
7 | 203612033136251 |
oct | 24412636053000 |
9 | 4883867074018 |
10 | 1410200000000 |
11 | 4a4076155260 |
12 | 1a9381162b68 |
13 | a2c9ab7b62c |
14 | 4c37b150b28 |
15 | 26a38877085 |
hex | 14856785600 |
1410200000000 has 360 divisors, whose sum is σ = 3848236310952. Its totient is φ = 512000000000.
The previous prime is 1410199999979. The next prime is 1410200000059. The reversal of 1410200000000 is 20141.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 2199999680 + ... + 2200000320.
Almost surely, 21410200000000 is an apocalyptic number.
1410200000000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1410200000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1924118155476).
1410200000000 is an abundant number, since it is smaller than the sum of its proper divisors (2438036310952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1410200000000 is an frugal number, since it uses more digits than its factorization.
1410200000000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 710 (or 659 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 8.
Adding to 1410200000000 its reverse (20141), we get a palindrome (1410200020141).
The spelling of 1410200000000 in words is "one trillion, four hundred ten billion, two hundred million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •