Base | Representation |
---|---|
bin | 10100111111010111100… |
… | …010111011011110110101 |
3 | 12002220011110002110202110 |
4 | 110333113202323132311 |
5 | 142113044124132013 |
6 | 3022350543201233 |
7 | 206132524161552 |
oct | 24772742733665 |
9 | 5086143073673 |
10 | 1442430302133 |
11 | 506805335297 |
12 | 1b3676ba6219 |
13 | a6036324722 |
14 | 4db57883a29 |
15 | 277c31a62c3 |
hex | 14fd78bb7b5 |
1442430302133 has 16 divisors (see below), whose sum is σ = 1931182186176. Its totient is φ = 957651087360.
The previous prime is 1442430302129. The next prime is 1442430302141. The reversal of 1442430302133 is 3312030342441.
It is a happy number.
It is not a de Polignac number, because 1442430302133 - 22 = 1442430302129 is a prime.
It is a super-2 number, since 2×14424303021332 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1442430302133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1442430202133) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3059118 + ... + 3499008.
It is an arithmetic number, because the mean of its divisors is an integer number (120698886636).
Almost surely, 21442430302133 is an apocalyptic number.
It is an amenable number.
1442430302133 is a deficient number, since it is larger than the sum of its proper divisors (488751884043).
1442430302133 is a wasteful number, since it uses less digits than its factorization.
1442430302133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 444404.
The product of its (nonzero) digits is 20736, while the sum is 30.
Adding to 1442430302133 its reverse (3312030342441), we get a palindrome (4754460644574).
The spelling of 1442430302133 in words is "one trillion, four hundred forty-two billion, four hundred thirty million, three hundred two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •