Base | Representation |
---|---|
bin | 101111001110000111… |
… | …1001100000010111001 |
3 | 100200202010021212111101 |
4 | 1132130033030002321 |
5 | 3130134300200001 |
6 | 114330211131401 |
7 | 10216631213155 |
oct | 1363417140271 |
9 | 320663255441 |
10 | 101405475001 |
11 | 3a007824296 |
12 | 177a05a3b61 |
13 | 9740a5725c |
14 | 4c9d99a065 |
15 | 2987811a01 |
hex | 179c3cc0b9 |
101405475001 has 4 divisors (see below), whose sum is σ = 101409933604. Its totient is φ = 101401016400.
The previous prime is 101405474977. The next prime is 101405475007. The reversal of 101405475001 is 100574504101.
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 83838623401 + 17566851600 = 289549^2 + 132540^2 .
It is a cyclic number.
It is not a de Polignac number, because 101405475001 - 213 = 101405466809 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101405475007) 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 3 ways as a sum of consecutive naturals, for example, 2195010 + ... + 2240731.
It is an arithmetic number, because the mean of its divisors is an integer number (25352483401).
Almost surely, 2101405475001 is an apocalyptic number.
It is an amenable number.
101405475001 is a deficient number, since it is larger than the sum of its proper divisors (4458603).
101405475001 is an equidigital number, since it uses as much as digits as its factorization.
101405475001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4458602.
The product of its (nonzero) digits is 2800, while the sum is 28.
Adding to 101405475001 its reverse (100574504101), we get a palindrome (201979979102).
The spelling of 101405475001 in words is "one hundred one billion, four hundred five million, four hundred seventy-five thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •