Base | Representation |
---|---|
bin | 10010110101100101… |
… | …10101101110110001 |
3 | 222002210210100211222 |
4 | 21122302311232301 |
5 | 131202440230223 |
6 | 4351305114425 |
7 | 505420610042 |
oct | 113262655661 |
9 | 28083710758 |
10 | 10113211313 |
11 | 431a70a387 |
12 | 1b62a88a15 |
13 | c522a840a |
14 | 6bd1d28c9 |
15 | 3e2cc20c8 |
hex | 25acb5bb1 |
10113211313 has 12 divisors (see below), whose sum is σ = 10460389104. Its totient is φ = 9777220200.
The previous prime is 10113211279. The next prime is 10113211319. The reversal of 10113211313 is 31311231101.
It is not a de Polignac number, because 10113211313 - 218 = 10112949169 is a prime.
It is a super-2 number, since 2×101132113132 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10113211291 and 10113211300.
It is not an unprimeable number, because it can be changed into a prime (10113211319) 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 11 ways as a sum of consecutive naturals, for example, 1074518 + ... + 1083888.
It is an arithmetic number, because the mean of its divisors is an integer number (871699092).
Almost surely, 210113211313 is an apocalyptic number.
It is an amenable number.
10113211313 is a deficient number, since it is larger than the sum of its proper divisors (347177791).
10113211313 is an equidigital number, since it uses as much as digits as its factorization.
10113211313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10556 (or 10525 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 10113211313 its reverse (31311231101), we get a palindrome (41424442414).
The spelling of 10113211313 in words is "ten billion, one hundred thirteen million, two hundred eleven thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •