Base | Representation |
---|---|
bin | 101111001011000010… |
… | …0111000011100110001 |
3 | 100200110220210101101001 |
4 | 1132112010320130301 |
5 | 3124431320010001 |
6 | 114312035442001 |
7 | 10214234504401 |
oct | 1362604703461 |
9 | 320426711331 |
10 | 101302110001 |
11 | 39a64444674 |
12 | 17771a56301 |
13 | 9725505c31 |
14 | 4c8dd70801 |
15 | 297d6e5001 |
hex | 1796138731 |
101302110001 has 4 divisors (see below), whose sum is σ = 102689810212. Its totient is φ = 99914409792.
The previous prime is 101302109983. The next prime is 101302110043. The reversal of 101302110001 is 100011203101.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 19762736400 + 81539373601 = 140580^2 + 285551^2 .
It is a cyclic number.
It is not a de Polignac number, because 101302110001 - 213 = 101302101809 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 101302110001.
It is not an unprimeable number, because it can be changed into a prime (101302110601) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 693849996 + ... + 693850141.
It is an arithmetic number, because the mean of its divisors is an integer number (25672452553).
Almost surely, 2101302110001 is an apocalyptic number.
It is an amenable number.
101302110001 is a deficient number, since it is larger than the sum of its proper divisors (1387700211).
101302110001 is an equidigital number, since it uses as much as digits as its factorization.
101302110001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1387700210.
The product of its (nonzero) digits is 6, while the sum is 10.
Adding to 101302110001 its reverse (100011203101), we get a palindrome (201313313102).
The spelling of 101302110001 in words is "one hundred one billion, three hundred two million, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •