Base | Representation |
---|---|
bin | 10010110101001110… |
… | …11011100000100011 |
3 | 222002121011101222120 |
4 | 21122213123200203 |
5 | 131201204022243 |
6 | 4351121035323 |
7 | 505353312000 |
oct | 113247334043 |
9 | 28077141876 |
10 | 10110220323 |
11 | 4318a57195 |
12 | 1b61a85b43 |
13 | c5179bbb8 |
14 | 6bca548a7 |
15 | 3e28d0c83 |
hex | 25a9db823 |
10110220323 has 32 divisors (see below), whose sum is σ = 16262592000. Its totient is φ = 5578036128.
The previous prime is 10110220313. The next prime is 10110220333. The reversal of 10110220323 is 32302201101.
10110220323 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (10110220313) and next prime (10110220333).
It is not a de Polignac number, because 10110220323 - 26 = 10110220259 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10110220313) 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 in 31 ways as a sum of consecutive naturals, for example, 139561 + ... + 199242.
It is an arithmetic number, because the mean of its divisors is an integer number (508206000).
Almost surely, 210110220323 is an apocalyptic number.
10110220323 is a deficient number, since it is larger than the sum of its proper divisors (6152371677).
10110220323 is an equidigital number, since it uses as much as digits as its factorization.
10110220323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 338856 (or 338842 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 10110220323 its reverse (32302201101), we get a palindrome (42412421424).
The spelling of 10110220323 in words is "ten billion, one hundred ten million, two hundred twenty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •