Base | Representation |
---|---|
bin | 101111001011111010… |
… | …0001110111010100001 |
3 | 100200112221201101112011 |
4 | 1132113310032322201 |
5 | 3130011303100001 |
6 | 114315001232521 |
7 | 10215040560421 |
oct | 1362764167241 |
9 | 320487641464 |
10 | 101331300001 |
11 | 39a79971538 |
12 | 1777b792741 |
13 | 972b586319 |
14 | 4c93bac481 |
15 | 298105dd51 |
hex | 1797d0eea1 |
101331300001 has 4 divisors (see below), whose sum is σ = 101976722452. Its totient is φ = 100685877552.
The previous prime is 101331299981. The next prime is 101331300047. The reversal of 101331300001 is 100003133101.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 100003133101 = 89 ⋅1123630709.
It can be written as a sum of positive squares in 2 ways, for example, as 60737109601 + 40594190400 = 246449^2 + 201480^2 .
It is a cyclic number.
It is not a de Polignac number, because 101331300001 - 217 = 101331168929 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101331300601) 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, 322710990 + ... + 322711303.
It is an arithmetic number, because the mean of its divisors is an integer number (25494180613).
Almost surely, 2101331300001 is an apocalyptic number.
It is an amenable number.
101331300001 is a deficient number, since it is larger than the sum of its proper divisors (645422451).
101331300001 is an equidigital number, since it uses as much as digits as its factorization.
101331300001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 645422450.
The product of its (nonzero) digits is 27, while the sum is 13.
Adding to 101331300001 its reverse (100003133101), we get a palindrome (201334433102).
The spelling of 101331300001 in words is "one hundred one billion, three hundred thirty-one million, three hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •