Base | Representation |
---|---|
bin | 1001001100000000111011… |
… | …0010111001100010100101 |
3 | 1022202202001112111102121120 |
4 | 2103000032302321202211 |
5 | 2311002404343212401 |
6 | 33252444441204153 |
7 | 2061563154205203 |
oct | 223001662714245 |
9 | 38682045442546 |
10 | 10102011304101 |
11 | 324526a027712 |
12 | 1171a07190659 |
13 | 58380056c622 |
14 | 26cd2334c073 |
15 | 127b9aa24836 |
hex | 9300ecb98a5 |
10102011304101 has 32 divisors (see below), whose sum is σ = 14798017889280. Its totient is φ = 6101451417600.
The previous prime is 10102011304079. The next prime is 10102011304123. The reversal of 10102011304101 is 10140311020101.
It is an interprime number because it is at equal distance from previous prime (10102011304079) and next prime (10102011304123).
It is not a de Polignac number, because 10102011304101 - 29 = 10102011303589 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10102011304171) 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 31 ways as a sum of consecutive naturals, for example, 5014786 + ... + 6734396.
It is an arithmetic number, because the mean of its divisors is an integer number (462438059040).
Almost surely, 210102011304101 is an apocalyptic number.
It is an amenable number.
10102011304101 is a deficient number, since it is larger than the sum of its proper divisors (4696006585179).
10102011304101 is a wasteful number, since it uses less digits than its factorization.
10102011304101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1724137.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 10102011304101 its reverse (10140311020101), we get a palindrome (20242322324202).
The spelling of 10102011304101 in words is "ten trillion, one hundred two billion, eleven million, three hundred four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •