Base | Representation |
---|---|
bin | 10100101100011101000… |
… | …100111111110010110000 |
3 | 12000221202010111001120020 |
4 | 110230131010333302300 |
5 | 141300001214232422 |
6 | 3005151442243440 |
7 | 204513336520116 |
oct | 24543504776260 |
9 | 5027663431506 |
10 | 1422122024112 |
11 | 4a9133898449 |
12 | 1ab749956580 |
13 | a414ab1117a |
14 | 4cb8c671ab6 |
15 | 26ed534395c |
hex | 14b1d13fcb0 |
1422122024112 has 20 divisors (see below), whose sum is σ = 3673815229080. Its totient is φ = 474040674688.
The previous prime is 1422122024101. The next prime is 1422122024117. The reversal of 1422122024112 is 2114202212241.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is not an unprimeable number, because it can be changed into a prime (1422122024117) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14813771037 + ... + 14813771132.
It is an arithmetic number, because the mean of its divisors is an integer number (183690761454).
Almost surely, 21422122024112 is an apocalyptic number.
1422122024112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1422122024112 is an abundant number, since it is smaller than the sum of its proper divisors (2251693204968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1422122024112 is a wasteful number, since it uses less digits than its factorization.
1422122024112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29627542180 (or 29627542174 counting only the distinct ones).
The product of its (nonzero) digits is 1024, while the sum is 24.
Adding to 1422122024112 its reverse (2114202212241), we get a palindrome (3536324236353).
The spelling of 1422122024112 in words is "one trillion, four hundred twenty-two billion, one hundred twenty-two million, twenty-four thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •