Base | Representation |
---|---|
bin | 1001010101100000… |
… | …00110110100011011 |
3 | 110221022101012220122 |
4 | 10222300012310123 |
5 | 40231112034321 |
6 | 2145205143455 |
7 | 235131114554 |
oct | 45260066433 |
9 | 13838335818 |
10 | 5012221211 |
11 | 21422a4a88 |
12 | b7a6bab8b |
13 | 61b54a48a |
14 | 35796332b |
15 | 1e506c8ab |
hex | 12ac06d1b |
5012221211 has 4 divisors (see below), whose sum is σ = 5012896392. Its totient is φ = 5011546032.
The previous prime is 5012221127. The next prime is 5012221217. The reversal of 5012221211 is 1121222105.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5012221211 is a prime.
It is a super-2 number, since 2×50122212112 = 50244722935996613042, which contains 22 as substring.
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 5012221211.
It is not an unprimeable number, because it can be changed into a prime (5012221217) 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, 326330 + ... + 341343.
It is an arithmetic number, because the mean of its divisors is an integer number (1253224098).
Almost surely, 25012221211 is an apocalyptic number.
5012221211 is a deficient number, since it is larger than the sum of its proper divisors (675181).
5012221211 is an equidigital number, since it uses as much as digits as its factorization.
5012221211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 675180.
The product of its (nonzero) digits is 80, while the sum is 17.
The square root of 5012221211 is about 70797.0423887891. The cubic root of 5012221211 is about 1711.3680115674.
Adding to 5012221211 its reverse (1121222105), we get a palindrome (6133443316).
The spelling of 5012221211 in words is "five billion, twelve million, two hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •