Base | Representation |
---|---|
bin | 1001010101100000… |
… | …00111000010011001 |
3 | 110221022101021010202 |
4 | 10222300013002121 |
5 | 40231112101410 |
6 | 2145205151545 |
7 | 235131120302 |
oct | 45260070231 |
9 | 13838337122 |
10 | 5012222105 |
11 | 21422a5720 |
12 | b7a6bb5b5 |
13 | 61b54a9c7 |
14 | 3579637a9 |
15 | 1e506cca5 |
hex | 12ac07099 |
5012222105 has 16 divisors (see below), whose sum is σ = 6787713600. Its totient is φ = 3519552960.
The previous prime is 5012222093. The next prime is 5012222113.
It is a happy number.
5012222105 is nontrivially palindromic in base 10.
5012222105 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 5012222105 - 218 = 5011959961 is a prime.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1569635 + ... + 1572824.
It is an arithmetic number, because the mean of its divisors is an integer number (424232100).
Almost surely, 25012222105 is an apocalyptic number.
5012222105 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
5012222105 is a deficient number, since it is larger than the sum of its proper divisors (1775491495).
5012222105 is a wasteful number, since it uses less digits than its factorization.
5012222105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3142504.
The product of its (nonzero) digits is 400, while the sum is 20.
The square root of 5012222105 is about 70797.0487026119. The cubic root of 5012222105 is about 1711.3681133162.
It can be divided in two parts, 50122 and 22105, that added together give a palindrome (72227).
The spelling of 5012222105 in words is "five billion, twelve million, two hundred twenty-two thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •