Base | Representation |
---|---|
bin | 1100010010100111010… |
… | …00110110100001001001 |
3 | 1111101001111210110100122 |
4 | 12021103220312201021 |
5 | 23404342330404001 |
6 | 522001225113025 |
7 | 42340143611462 |
oct | 6112350664111 |
9 | 1441044713318 |
10 | 422310013001 |
11 | 153111aa1378 |
12 | 69a1a928775 |
13 | 30a92785876 |
14 | 166231a1d69 |
15 | aeba362b1b |
hex | 6253a36849 |
422310013001 has 8 divisors (see below), whose sum is σ = 426287347200. Its totient is φ = 418334550480.
The previous prime is 422310012959. The next prime is 422310013019. The reversal of 422310013001 is 100310013224.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 422310013001 - 226 = 422242904137 is a prime.
It is a super-3 number, since 3×4223100130013 (a number of 36 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (422310213001) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 12455 + ... + 919116.
It is an arithmetic number, because the mean of its divisors is an integer number (53285918400).
Almost surely, 2422310013001 is an apocalyptic number.
It is an amenable number.
422310013001 is a deficient number, since it is larger than the sum of its proper divisors (3977334199).
422310013001 is a wasteful number, since it uses less digits than its factorization.
422310013001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 935839.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 422310013001 its reverse (100310013224), we get a palindrome (522620026225).
The spelling of 422310013001 in words is "four hundred twenty-two billion, three hundred ten million, thirteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •