Base | Representation |
---|---|
bin | 101111001110110110… |
… | …1001001000101010001 |
3 | 100200210211122011200101 |
4 | 1132131231021011101 |
5 | 3130212101320101 |
6 | 114332451052401 |
7 | 10220350443043 |
oct | 1363555110521 |
9 | 320724564611 |
10 | 101430104401 |
11 | 3a01a71676a |
12 | 177a88a1101 |
13 | 9745b9b872 |
14 | 4ca2d6ba93 |
15 | 2989a79401 |
hex | 179db49151 |
101430104401 has 4 divisors (see below), whose sum is σ = 104171458612. Its totient is φ = 98688750192.
The previous prime is 101430104371. The next prime is 101430104411. The reversal of 101430104401 is 104401034101.
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 61139980225 + 40290124176 = 247265^2 + 200724^2 .
It is a cyclic number.
It is not a de Polignac number, because 101430104401 - 27 = 101430104273 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101430104411) 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, 1370677050 + ... + 1370677123.
It is an arithmetic number, because the mean of its divisors is an integer number (26042864653).
Almost surely, 2101430104401 is an apocalyptic number.
It is an amenable number.
101430104401 is a deficient number, since it is larger than the sum of its proper divisors (2741354211).
101430104401 is an equidigital number, since it uses as much as digits as its factorization.
101430104401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2741354210.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 101430104401 its reverse (104401034101), we get a palindrome (205831138502).
The spelling of 101430104401 in words is "one hundred one billion, four hundred thirty million, one hundred four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •