Base | Representation |
---|---|
bin | 10111000010101100001110… |
… | …110100101100100001100001 |
3 | 111021211000020222120100212002 |
4 | 113002230032310230201201 |
5 | 101240323311010402001 |
6 | 555310542041013345 |
7 | 30226400502446630 |
oct | 2702541664544141 |
9 | 437730228510762 |
10 | 101340002044001 |
11 | 2a321065253066 |
12 | b448455784255 |
13 | 447142385a0b6 |
14 | 1b04c4cd3b517 |
15 | bab14548246b |
hex | 5c2b0ed2c861 |
101340002044001 has 8 divisors (see below), whose sum is σ = 116584146155904. Its totient is φ = 86287608172800.
The previous prime is 101340002043997. The next prime is 101340002044003. The reversal of 101340002044001 is 100440200043101.
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 101340002044001 - 22 = 101340002043997 is a prime.
It is a super-3 number, since 3×1013400020440013 (a number of 43 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (101340002044003) 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, 47937559040 + ... + 47937561153.
It is an arithmetic number, because the mean of its divisors is an integer number (14573018269488).
Almost surely, 2101340002044001 is an apocalyptic number.
It is an amenable number.
101340002044001 is a deficient number, since it is larger than the sum of its proper divisors (15244144111903).
101340002044001 is an equidigital number, since it uses as much as digits as its factorization.
101340002044001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95875120351.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 101340002044001 its reverse (100440200043101), we get a palindrome (201780202087102).
The spelling of 101340002044001 in words is "one hundred one trillion, three hundred forty billion, two million, forty-four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •