Base | Representation |
---|---|
bin | 1111111010100111… |
… | …0001001010100001 |
3 | 102000202012111002000 |
4 | 3332221301022201 |
5 | 32222211042040 |
6 | 1543535314213 |
7 | 210605323212 |
oct | 37651611241 |
9 | 12022174060 |
10 | 4272362145 |
11 | 18a2700a07 |
12 | 9b297b969 |
13 | 53119374c |
14 | 2c75b1409 |
15 | 1a0125130 |
hex | fea712a1 |
4272362145 has 16 divisors (see below), whose sum is σ = 7595310720. Its totient is φ = 2278593072.
The previous prime is 4272362119. The next prime is 4272362209. The reversal of 4272362145 is 5412632724.
4272362145 is a `hidden beast` number, since 4 + 2 + 7 + 23 + 621 + 4 + 5 = 666.
It is not a de Polignac number, because 4272362145 - 28 = 4272361889 is a prime.
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15823429 + ... + 15823698.
It is an arithmetic number, because the mean of its divisors is an integer number (474706920).
Almost surely, 24272362145 is an apocalyptic number.
4272362145 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
It is an amenable number.
4272362145 is a deficient number, since it is larger than the sum of its proper divisors (3322948575).
4272362145 is a wasteful number, since it uses less digits than its factorization.
4272362145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31647141 (or 31647135 counting only the distinct ones).
The product of its digits is 80640, while the sum is 36.
The square root of 4272362145 is about 65363.3088590227. The cubic root of 4272362145 is about 1622.6418998040.
Adding to 4272362145 its reverse (5412632724), we get a palindrome (9684994869).
The spelling of 4272362145 in words is "four billion, two hundred seventy-two million, three hundred sixty-two thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •