Base | Representation |
---|---|
bin | 10100100100111111000… |
… | …100100100010000110100 |
3 | 12000012001020011001022202 |
4 | 110210333010210100310 |
5 | 141132040203331400 |
6 | 3001344002044032 |
7 | 204110530043663 |
oct | 24447704442064 |
9 | 5005036131282 |
10 | 1414102402100 |
11 | 4a5798a38763 |
12 | 1aa090049618 |
13 | a34704ba9bb |
14 | 4c62b53adda |
15 | 26bb626e4d5 |
hex | 1493f124434 |
1414102402100 has 36 divisors (see below), whose sum is σ = 3097280761344. Its totient is φ = 560354592480.
The previous prime is 1414102402099. The next prime is 1414102402169. The reversal of 1414102402100 is 12042014141.
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 pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 66068852 + ... + 66090251.
It is an arithmetic number, because the mean of its divisors is an integer number (86035576704).
Almost surely, 21414102402100 is an apocalyptic number.
1414102402100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1414102402100 is an abundant number, since it is smaller than the sum of its proper divisors (1683178359244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1414102402100 is a wasteful number, since it uses less digits than its factorization.
1414102402100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132159224 (or 132159217 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 1414102402100 its reverse (12042014141), we get a palindrome (1426144416241).
The spelling of 1414102402100 in words is "one trillion, four hundred fourteen billion, one hundred two million, four hundred two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •