Base | Representation |
---|---|
bin | 10111000011100101111110… |
… | …111110111010110001100001 |
3 | 111022000221022122201021120010 |
4 | 113003211332332322301201 |
5 | 101242332310402023040 |
6 | 555355235233435133 |
7 | 30234024263525655 |
oct | 2703457676726141 |
9 | 438027278637503 |
10 | 101402013314145 |
11 | 2a345396a75155 |
12 | b45848110baa9 |
13 | 4477226ba935b |
14 | 1b07c52980a65 |
15 | baca74571e80 |
hex | 5c397efbac61 |
101402013314145 has 8 divisors (see below), whose sum is σ = 162243221302656. Its totient is φ = 54081073767536.
The previous prime is 101402013314131. The next prime is 101402013314177. The reversal of 101402013314145 is 541413310204101.
It is a happy number.
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 101402013314145 - 218 = 101402013052001 is a prime.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3380067110457 + ... + 3380067110486.
It is an arithmetic number, because the mean of its divisors is an integer number (20280402662832).
Almost surely, 2101402013314145 is an apocalyptic number.
101402013314145 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
101402013314145 is a deficient number, since it is larger than the sum of its proper divisors (60841207988511).
101402013314145 is an equidigital number, since it uses as much as digits as its factorization.
101402013314145 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6760134220951.
The product of its (nonzero) digits is 5760, while the sum is 30.
Adding to 101402013314145 its reverse (541413310204101), we get a palindrome (642815323518246).
The spelling of 101402013314145 in words is "one hundred one trillion, four hundred two billion, thirteen million, three hundred fourteen thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •