Base | Representation |
---|---|
bin | 101111001110010010… |
… | …1110010101011010001 |
3 | 100200202112102220121122 |
4 | 1132130211302223101 |
5 | 3130142304303101 |
6 | 114330542132025 |
7 | 10220032452323 |
oct | 1363445625321 |
9 | 320675386548 |
10 | 101411400401 |
11 | 3a010101113 |
12 | 177a2581015 |
13 | 97420502cc |
14 | 4ca069d613 |
15 | 29880d251b |
hex | 179c972ad1 |
101411400401 has 4 divisors (see below), whose sum is σ = 101416083252. Its totient is φ = 101406717552.
The previous prime is 101411400361. The next prime is 101411400403. The reversal of 101411400401 is 104004114101.
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 94480005376 + 6931395025 = 307376^2 + 83255^2 .
It is a cyclic number.
It is not a de Polignac number, because 101411400401 - 226 = 101344291537 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 101411400401.
It is not an unprimeable number, because it can be changed into a prime (101411400403) 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, 2308790 + ... + 2352303.
It is an arithmetic number, because the mean of its divisors is an integer number (25354020813).
Almost surely, 2101411400401 is an apocalyptic number.
It is an amenable number.
101411400401 is a deficient number, since it is larger than the sum of its proper divisors (4682851).
101411400401 is an equidigital number, since it uses as much as digits as its factorization.
101411400401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4682850.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 101411400401 its reverse (104004114101), we get a palindrome (205415514502).
The spelling of 101411400401 in words is "one hundred one billion, four hundred eleven million, four hundred thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •