Base | Representation |
---|---|
bin | 1111101100001111… |
… | …1101111010111000 |
3 | 101212112211221010120 |
4 | 3323003331322320 |
5 | 32111300340042 |
6 | 1533544213240 |
7 | 206244303642 |
oct | 37303757270 |
9 | 11775757116 |
10 | 4212121272 |
11 | 18716a6067 |
12 | 99676a220 |
13 | 521860c68 |
14 | 2bd5ad892 |
15 | 199bc5dec |
hex | fb0fdeb8 |
4212121272 has 16 divisors (see below), whose sum is σ = 10530303240. Its totient is φ = 1404040416.
The previous prime is 4212121259. The next prime is 4212121273. The reversal of 4212121272 is 2721212124.
It is a super-2 number, since 2×42121212722 = 35483931220069795968, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24), and also a Moran number because the ratio is a prime number: 175505053 = 4212121272 / (4 + 2 + 1 + 2 + 1 + 2 + 1 + 2 + 7 + 2).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4212121273) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 87752503 + ... + 87752550.
Almost surely, 24212121272 is an apocalyptic number.
It is an amenable number.
4212121272 is an abundant number, since it is smaller than the sum of its proper divisors (6318181968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4212121272 is a wasteful number, since it uses less digits than its factorization.
4212121272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 175505062 (or 175505058 counting only the distinct ones).
The product of its digits is 896, while the sum is 24.
The square root of 4212121272 is about 64900.8572516573. The cubic root of 4212121272 is about 1614.9792828355.
Adding to 4212121272 its reverse (2721212124), we get a palindrome (6933333396).
The spelling of 4212121272 in words is "four billion, two hundred twelve million, one hundred twenty-one thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •