Base | Representation |
---|---|
bin | 10010110101010110… |
… | …10010000110010111 |
3 | 222002200001201111022 |
4 | 21122223102012113 |
5 | 131201433332414 |
6 | 4351154431355 |
7 | 505365016466 |
oct | 113253220627 |
9 | 28080051438 |
10 | 10111230359 |
11 | 431958702a |
12 | 1b6229255b |
13 | c51a63859 |
14 | 6bcc389dd |
15 | 3e2a3018e |
hex | 25aad2197 |
10111230359 has 2 divisors, whose sum is σ = 10111230360. Its totient is φ = 10111230358.
The previous prime is 10111230271. The next prime is 10111230383. The reversal of 10111230359 is 95303211101.
10111230359 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10111230359 - 224 = 10094453143 is a prime.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10111230559) by changing a digit.
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 as a sum of consecutive naturals, namely, 5055615179 + 5055615180.
It is an arithmetic number, because the mean of its divisors is an integer number (5055615180).
Almost surely, 210111230359 is an apocalyptic number.
10111230359 is a deficient number, since it is larger than the sum of its proper divisors (1).
10111230359 is an equidigital number, since it uses as much as digits as its factorization.
10111230359 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 810, while the sum is 26.
The spelling of 10111230359 in words is "ten billion, one hundred eleven million, two hundred thirty thousand, three hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •