Base | Representation |
---|---|
bin | 10010110100001010… |
… | …11100111001001101 |
3 | 222001222101212120110 |
4 | 21122011130321031 |
5 | 131141414004401 |
6 | 4350202110233 |
7 | 505214513265 |
oct | 113205347115 |
9 | 28058355513 |
10 | 10101313101 |
11 | 4313a23050 |
12 | 1b5aaab379 |
13 | c4c9a0859 |
14 | 6bb7b67a5 |
15 | 3e1c219d6 |
hex | 25a15ce4d |
10101313101 has 32 divisors (see below), whose sum is σ = 14861905920. Its totient is φ = 6051752000.
The previous prime is 10101313091. The next prime is 10101313109. The reversal of 10101313101 is 10131310101.
10101313101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 10101313101 - 210 = 10101312077 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10101313109) 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, 2474380 + ... + 2478458.
It is an arithmetic number, because the mean of its divisors is an integer number (464434560).
Almost surely, 210101313101 is an apocalyptic number.
10101313101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10101313101 is a deficient number, since it is larger than the sum of its proper divisors (4760592819).
10101313101 is a wasteful number, since it uses less digits than its factorization.
10101313101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4937.
The product of its (nonzero) digits is 9, while the sum is 12.
Adding to 10101313101 its reverse (10131310101), we get a palindrome (20232623202).
The spelling of 10101313101 in words is "ten billion, one hundred one million, three hundred thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •