Base | Representation |
---|---|
bin | 10010101000001110… |
… | …01011000111110110 |
3 | 221210222211120211100 |
4 | 21110013023013312 |
5 | 130440240220202 |
6 | 4332222150530 |
7 | 502556646513 |
oct | 112407130766 |
9 | 27728746740 |
10 | 10001101302 |
11 | 42723a7485 |
12 | 1b31422446 |
13 | c34cb482a |
14 | 6ac36c30a |
15 | 3d802941c |
hex | 2541cb1f6 |
10001101302 has 48 divisors (see below), whose sum is σ = 21779746560. Its totient is φ = 3316714800.
The previous prime is 10001101277. The next prime is 10001101321. The reversal of 10001101302 is 20310110001.
10001101302 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (9).
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 23 ways as a sum of consecutive naturals, for example, 3687727 + ... + 3690437.
It is an arithmetic number, because the mean of its divisors is an integer number (453744720).
Almost surely, 210001101302 is an apocalyptic number.
10001101302 is an abundant number, since it is smaller than the sum of its proper divisors (11778645258).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10001101302 is a wasteful number, since it uses less digits than its factorization.
10001101302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3689 (or 3686 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 10001101302 its reverse (20310110001), we get a palindrome (30311211303).
The spelling of 10001101302 in words is "ten billion, one million, one hundred one thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •