Base | Representation |
---|---|
bin | 101010111111001… |
… | …1011110001000110 |
3 | 10201112012001000011 |
4 | 1111332123301012 |
5 | 10423230230042 |
6 | 355044140434 |
7 | 50513311225 |
oct | 12576336106 |
9 | 3645161004 |
10 | 1442430022 |
11 | 68023a030 |
12 | 34309771a |
13 | 19cab63b7 |
14 | d97d8cbc |
15 | 86976a17 |
hex | 55f9bc46 |
1442430022 has 8 divisors (see below), whose sum is σ = 2360340072. Its totient is φ = 655650000.
The previous prime is 1442430001. The next prime is 1442430029. The reversal of 1442430022 is 2200342441.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (22), and also a Moran number because the ratio is a prime number: 65565001 = 1442430022 / (1 + 4 + 4 + 2 + 4 + 3 + 0 + 0 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 1442429975 and 1442430002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1442430029) 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, 32782479 + ... + 32782522.
It is an arithmetic number, because the mean of its divisors is an integer number (295042509).
Almost surely, 21442430022 is an apocalyptic number.
1442430022 is a deficient number, since it is larger than the sum of its proper divisors (917910050).
1442430022 is a wasteful number, since it uses less digits than its factorization.
1442430022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 65565014.
The product of its (nonzero) digits is 1536, while the sum is 22.
The square root of 1442430022 is about 37979.3367767264. The cubic root of 1442430022 is about 1129.8780827560.
Adding to 1442430022 its reverse (2200342441), we get a palindrome (3642772463).
The spelling of 1442430022 in words is "one billion, four hundred forty-two million, four hundred thirty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •