Base | Representation |
---|---|
bin | 1001011101100110011100… |
… | …0100110101000101000111 |
3 | 1100211121220102011000021012 |
4 | 2113121213010311011013 |
5 | 2330430134332011101 |
6 | 34043332422112435 |
7 | 2122450201531304 |
oct | 227314704650507 |
9 | 40747812130235 |
10 | 10404140110151 |
11 | 3351409947457 |
12 | 120048557b71b |
13 | 5a614c433788 |
14 | 27d7c50b80ab |
15 | 13098003abbb |
hex | 97667135147 |
10404140110151 has 2 divisors, whose sum is σ = 10404140110152. Its totient is φ = 10404140110150.
The previous prime is 10404140110139. The next prime is 10404140110171. The reversal of 10404140110151 is 15101104140401.
It is a happy number.
10404140110151 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10404140110151 - 242 = 6006093599047 is a prime.
It is a super-2 number, since 2×104041401101512 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10404140110171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5202070055075 + 5202070055076.
It is an arithmetic number, because the mean of its divisors is an integer number (5202070055076).
Almost surely, 210404140110151 is an apocalyptic number.
10404140110151 is a deficient number, since it is larger than the sum of its proper divisors (1).
10404140110151 is an equidigital number, since it uses as much as digits as its factorization.
10404140110151 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 320, while the sum is 23.
Adding to 10404140110151 its reverse (15101104140401), we get a palindrome (25505244250552).
The spelling of 10404140110151 in words is "ten trillion, four hundred four billion, one hundred forty million, one hundred ten thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •