Base | Representation |
---|---|
bin | 10110111101110000110011… |
… | …011100010110110110111011 |
3 | 111020121122001020021021221210 |
4 | 112331300303130112312323 |
5 | 101214301142341120121 |
6 | 554451210232534203 |
7 | 30163050500560032 |
oct | 2675606334266673 |
9 | 436548036237853 |
10 | 101001314004411 |
11 | 2a200464725027 |
12 | b3b2893851363 |
13 | 44484c9710b92 |
14 | 1ad26bd983719 |
15 | ba2421590876 |
hex | 5bdc33716dbb |
101001314004411 has 8 divisors (see below), whose sum is σ = 134682780277584. Its totient is φ = 67327028533760.
The previous prime is 101001314004361. The next prime is 101001314004413. The reversal of 101001314004411 is 114400413100101.
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 101001314004411 - 214 = 101001313988027 is a prime.
It is not an unprimeable number, because it can be changed into a prime (101001314004413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1795167810 + ... + 1795224071.
It is an arithmetic number, because the mean of its divisors is an integer number (16835347534698).
Almost surely, 2101001314004411 is an apocalyptic number.
101001314004411 is a deficient number, since it is larger than the sum of its proper divisors (33681466273173).
101001314004411 is an equidigital number, since it uses as much as digits as its factorization.
101001314004411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3590401261.
The product of its (nonzero) digits is 192, while the sum is 21.
Adding to 101001314004411 its reverse (114400413100101), we get a palindrome (215401727104512).
The spelling of 101001314004411 in words is "one hundred one trillion, one billion, three hundred fourteen million, four thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •