Base | Representation |
---|---|
bin | 100010000011010… |
… | …0010011000110001 |
3 | 2221121221021201001 |
4 | 1010012202120301 |
5 | 4314444030101 |
6 | 305213042001 |
7 | 40212431356 |
oct | 10406423061 |
9 | 2847837631 |
10 | 1142564401 |
11 | 536a47600 |
12 | 27a786301 |
13 | 152934814 |
14 | aba5c62d |
15 | 6a492901 |
hex | 441a2631 |
1142564401 has 12 divisors (see below), whose sum is σ = 1263419136. Its totient is φ = 1032456920.
The previous prime is 1142564387. The next prime is 1142564413. The reversal of 1142564401 is 1044652411.
It is not a de Polignac number, because 1142564401 - 25 = 1142564369 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1142564401.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1142564431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8065 + ... + 48478.
It is an arithmetic number, because the mean of its divisors is an integer number (105284928).
Almost surely, 21142564401 is an apocalyptic number.
1142564401 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1142564401 is a deficient number, since it is larger than the sum of its proper divisors (120854735).
1142564401 is a wasteful number, since it uses less digits than its factorization.
1142564401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56732 (or 56721 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 28.
The square root of 1142564401 is about 33801.8402013855. The cubic root of 1142564401 is about 1045.4266401971.
The spelling of 1142564401 in words is "one billion, one hundred forty-two million, five hundred sixty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •