Base | Representation |
---|---|
bin | 1001000010111100… |
… | …1000100111000111 |
3 | 20021020020011021102 |
4 | 2100233020213013 |
5 | 14433114301033 |
6 | 1040542210315 |
7 | 114113666240 |
oct | 22057104707 |
9 | 6236204242 |
10 | 2428275143 |
11 | 1036775068 |
12 | 57928399b |
13 | 2c91087c8 |
14 | 1906ddcc7 |
15 | e32adde8 |
hex | 90bc89c7 |
2428275143 has 16 divisors (see below), whose sum is σ = 2856403200. Its totient is φ = 2020939200.
The previous prime is 2428275131. The next prime is 2428275151. The reversal of 2428275143 is 3415728242.
It is a happy number.
It is not a de Polignac number, because 2428275143 - 26 = 2428275079 is a prime.
It is a super-2 number, since 2×24282751432 = 11793040340223340898, which contains 22 as substring.
It is a Smith number, since the sum of its digits (38) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 2428275097 and 2428275106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2428275173) 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, 40508 + ... + 80606.
It is an arithmetic number, because the mean of its divisors is an integer number (178525200).
Almost surely, 22428275143 is an apocalyptic number.
2428275143 is a deficient number, since it is larger than the sum of its proper divisors (428128057).
2428275143 is a wasteful number, since it uses less digits than its factorization.
2428275143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40358.
The product of its digits is 107520, while the sum is 38.
The square root of 2428275143 is about 49277.5318273957. The cubic root of 2428275143 is about 1344.1032506346.
The spelling of 2428275143 in words is "two billion, four hundred twenty-eight million, two hundred seventy-five thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •