Base | Representation |
---|---|
bin | 10100101011110110110… |
… | …110001111000001100011 |
3 | 12000220002102120100201020 |
4 | 110223312312033001203 |
5 | 141242143014321011 |
6 | 3005004050540523 |
7 | 204461420624505 |
oct | 24536666170143 |
9 | 5026072510636 |
10 | 1421480620131 |
11 | 4a8934830110 |
12 | 1ab5aab97743 |
13 | a4077c799a0 |
14 | 4cb2b3cbd75 |
15 | 26e98d98006 |
hex | 14af6d8f063 |
1421480620131 has 32 divisors (see below), whose sum is σ = 2233908112128. Its totient is φ = 792643501440.
The previous prime is 1421480620123. The next prime is 1421480620169. The reversal of 1421480620131 is 1310260841241.
It is not a de Polignac number, because 1421480620131 - 23 = 1421480620123 is a prime.
It is a super-2 number, since 2×14214806201312 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 1421480620092 and 1421480620101.
It is not an unprimeable number, because it can be changed into a prime (1421480620531) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5264836 + ... + 5528241.
It is an arithmetic number, because the mean of its divisors is an integer number (69809628504).
Almost surely, 21421480620131 is an apocalyptic number.
1421480620131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1421480620131 is a deficient number, since it is larger than the sum of its proper divisors (812427491997).
1421480620131 is a wasteful number, since it uses less digits than its factorization.
1421480620131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10793411.
The product of its (nonzero) digits is 9216, while the sum is 33.
The spelling of 1421480620131 in words is "one trillion, four hundred twenty-one billion, four hundred eighty million, six hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •