Base | Representation |
---|---|
bin | 110000100101010… |
… | …0000011110110001 |
3 | 11012121101220202202 |
4 | 1201022200132301 |
5 | 11314304110213 |
6 | 425431352545 |
7 | 55252666451 |
oct | 14112403661 |
9 | 4177356682 |
10 | 1630144433 |
11 | 7671a0705 |
12 | 395b22755 |
13 | 1cc95b708 |
14 | 1166ddd61 |
15 | 981a5b58 |
hex | 612a07b1 |
1630144433 has 16 divisors (see below), whose sum is σ = 1794130560. Its totient is φ = 1474233600.
The previous prime is 1630144421. The next prime is 1630144447. The reversal of 1630144433 is 3344410361.
It is a cyclic number.
It is not a de Polignac number, because 1630144433 - 28 = 1630144177 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1630144396 and 1630144405.
It is not an unprimeable number, because it can be changed into a prime (1630144333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 96188 + ... + 111858.
It is an arithmetic number, because the mean of its divisors is an integer number (112133160).
Almost surely, 21630144433 is an apocalyptic number.
It is an amenable number.
1630144433 is a deficient number, since it is larger than the sum of its proper divisors (163986127).
1630144433 is a wasteful number, since it uses less digits than its factorization.
1630144433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15928.
The product of its (nonzero) digits is 10368, while the sum is 29.
The square root of 1630144433 is about 40375.0471578672. The cubic root of 1630144433 is about 1176.9066814337.
Adding to 1630144433 its reverse (3344410361), we get a palindrome (4974554794).
The spelling of 1630144433 in words is "one billion, six hundred thirty million, one hundred forty-four thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •