Base | Representation |
---|---|
bin | 1001001100101110111101… |
… | …1111110100011110010001 |
3 | 1022210220221220122122222002 |
4 | 2103023233133310132101 |
5 | 2311203213001021201 |
6 | 33302251122523345 |
7 | 2062511354632106 |
oct | 223135737643621 |
9 | 38726856578862 |
10 | 10114371110801 |
11 | 324a5318a13a1 |
12 | 1174296506555 |
13 | 584a20111c09 |
14 | 26d776a6aaad |
15 | 128170b6976b |
hex | 932ef7f4791 |
10114371110801 has 8 divisors (see below), whose sum is σ = 10839373036224. Its totient is φ = 9413139740400.
The previous prime is 10114371110773. The next prime is 10114371110843. The reversal of 10114371110801 is 10801117341101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10114371110801 - 218 = 10114370848657 is a prime.
It is a super-3 number, since 3×101143711108013 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10114371110861) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5942637875 + ... + 5942639576.
It is an arithmetic number, because the mean of its divisors is an integer number (1354921629528).
Almost surely, 210114371110801 is an apocalyptic number.
It is an amenable number.
10114371110801 is a deficient number, since it is larger than the sum of its proper divisors (725001925423).
10114371110801 is a wasteful number, since it uses less digits than its factorization.
10114371110801 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11885277511.
The product of its (nonzero) digits is 672, while the sum is 29.
Adding to 10114371110801 its reverse (10801117341101), we get a palindrome (20915488451902).
The spelling of 10114371110801 in words is "ten trillion, one hundred fourteen billion, three hundred seventy-one million, one hundred ten thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •