Base | Representation |
---|---|
bin | 10010110101100101… |
… | …10011000010110110 |
3 | 222002210202210202110 |
4 | 21122302303002312 |
5 | 131202434402220 |
6 | 4351304551450 |
7 | 505420533003 |
oct | 113262630266 |
9 | 28083683673 |
10 | 10113200310 |
11 | 431a702094 |
12 | 1b62a82586 |
13 | c522a33c5 |
14 | 6bd1cc8aa |
15 | 3e2cbdbe0 |
hex | 25acb30b6 |
10113200310 has 16 divisors (see below), whose sum is σ = 24271680816. Its totient is φ = 2696853408.
The previous prime is 10113200299. The next prime is 10113200341. The reversal of 10113200310 is 1300231101.
10113200310 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×101132003102 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 168553309 + ... + 168553368.
It is an arithmetic number, because the mean of its divisors is an integer number (1516980051).
Almost surely, 210113200310 is an apocalyptic number.
10113200310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10113200310 is an abundant number, since it is smaller than the sum of its proper divisors (14158480506).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10113200310 is a wasteful number, since it uses less digits than its factorization.
10113200310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 337106687.
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 10113200310 its reverse (1300231101), we get a palindrome (11413431411).
The spelling of 10113200310 in words is "ten billion, one hundred thirteen million, two hundred thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •