Base | Representation |
---|---|
bin | 10010110111101101… |
… | …01111001000111110 |
3 | 222011001021122012200 |
4 | 21123312233020332 |
5 | 131222014310420 |
6 | 4353142412330 |
7 | 506025110424 |
oct | 113366571076 |
9 | 28131248180 |
10 | 10131010110 |
11 | 4329766931 |
12 | 1b68a310a6 |
13 | c55b9a950 |
14 | 6c1707114 |
15 | 3e463ab90 |
hex | 25bdaf23e |
10131010110 has 48 divisors (see below), whose sum is σ = 28366831584. Its totient is φ = 2493786816.
The previous prime is 10131010081. The next prime is 10131010181. The reversal of 10131010110 is 1101013101.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 10131010092 and 10131010101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4328322 + ... + 4330661.
It is an arithmetic number, because the mean of its divisors is an integer number (590975658).
Almost surely, 210131010110 is an apocalyptic number.
10131010110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10131010110 is an abundant number, since it is smaller than the sum of its proper divisors (18235821474).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10131010110 is a wasteful number, since it uses less digits than its factorization.
10131010110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8659009 (or 8659006 counting only the distinct ones).
The product of its (nonzero) digits is 3, while the sum is 9.
Adding to 10131010110 its reverse (1101013101), we get a palindrome (11232023211).
The spelling of 10131010110 in words is "ten billion, one hundred thirty-one million, ten thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •