Base | Representation |
---|---|
bin | 10010110101101110… |
… | …01010100011110101 |
3 | 222002212220222020222 |
4 | 21122313022203311 |
5 | 131203233021310 |
6 | 4351345304125 |
7 | 505433341616 |
oct | 113267124365 |
9 | 28085828228 |
10 | 10114345205 |
11 | 4320314288 |
12 | 1b63335045 |
13 | c525b4563 |
14 | 6bd409c0d |
15 | 3e2e48055 |
hex | 25adca8f5 |
10114345205 has 4 divisors (see below), whose sum is σ = 12137214252. Its totient is φ = 8091476160.
The previous prime is 10114345201. The next prime is 10114345207. The reversal of 10114345205 is 50254341101.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 4662294961 + 5452050244 = 68281^2 + 73838^2 .
It is not a de Polignac number, because 10114345205 - 22 = 10114345201 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10114345201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1011434516 + ... + 1011434525.
It is an arithmetic number, because the mean of its divisors is an integer number (3034303563).
Almost surely, 210114345205 is an apocalyptic number.
It is an amenable number.
10114345205 is a deficient number, since it is larger than the sum of its proper divisors (2022869047).
10114345205 is an equidigital number, since it uses as much as digits as its factorization.
10114345205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2022869046.
The product of its (nonzero) digits is 2400, while the sum is 26.
Adding to 10114345205 its reverse (50254341101), we get a palindrome (60368686306).
The spelling of 10114345205 in words is "ten billion, one hundred fourteen million, three hundred forty-five thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •