Base | Representation |
---|---|
bin | 10100101010110010011… |
… | …000101011100101010100 |
3 | 12000210010101021112102102 |
4 | 110222302120223211110 |
5 | 141232314444201400 |
6 | 3004254100301232 |
7 | 204421102663265 |
oct | 24526230534524 |
9 | 5023111245372 |
10 | 1420332022100 |
11 | 4a83a5442442 |
12 | 1ab32a3a1818 |
13 | a3c24011a94 |
14 | 4ca5ca3c96c |
15 | 26e2d1129d5 |
hex | 14ab262b954 |
1420332022100 has 36 divisors (see below), whose sum is σ = 3090167883264. Its totient is φ = 566649418080.
The previous prime is 1420332022099. The next prime is 1420332022103. The reversal of 1420332022100 is 12202330241.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1420332022103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 18503894 + ... + 18580493.
Almost surely, 21420332022100 is an apocalyptic number.
1420332022100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1420332022100 is an abundant number, since it is smaller than the sum of its proper divisors (1669835861164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1420332022100 is a wasteful number, since it uses less digits than its factorization.
1420332022100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37084784 (or 37084777 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 1420332022100 its reverse (12202330241), we get a palindrome (1432534352341).
The spelling of 1420332022100 in words is "one trillion, four hundred twenty billion, three hundred thirty-two million, twenty-two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •