Base | Representation |
---|---|
bin | 10100101100101010101… |
… | …011011101111110001001 |
3 | 12000222100000212020212120 |
4 | 110230222223131332021 |
5 | 141300433123304001 |
6 | 3005230233201453 |
7 | 204522110220624 |
oct | 24545253357611 |
9 | 5028300766776 |
10 | 1422350213001 |
11 | 4a9240684103 |
12 | 1ab7b2260289 |
13 | a4186187c93 |
14 | 4cbb0ab0dbb |
15 | 26eea3ba236 |
hex | 14b2aaddf89 |
1422350213001 has 16 divisors (see below), whose sum is σ = 1965858068160. Its totient is φ = 913671106880.
The previous prime is 1422350212999. The next prime is 1422350213003. The reversal of 1422350213001 is 1003120532241.
It is an interprime number because it is at equal distance from previous prime (1422350212999) and next prime (1422350213003).
It is a cyclic number.
It is not a de Polignac number, because 1422350213001 - 21 = 1422350212999 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1422350213003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16605810 + ... + 16691243.
It is an arithmetic number, because the mean of its divisors is an integer number (122866129260).
Almost surely, 21422350213001 is an apocalyptic number.
It is an amenable number.
1422350213001 is a deficient number, since it is larger than the sum of its proper divisors (543507855159).
1422350213001 is a wasteful number, since it uses less digits than its factorization.
1422350213001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33297576.
The product of its (nonzero) digits is 1440, while the sum is 24.
Adding to 1422350213001 its reverse (1003120532241), we get a palindrome (2425470745242).
The spelling of 1422350213001 in words is "one trillion, four hundred twenty-two billion, three hundred fifty million, two hundred thirteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •