Base | Representation |
---|---|
bin | 10111000011110111000011… |
… | …100101110111100010111101 |
3 | 111022002200122011121000120101 |
4 | 113003313003211313202331 |
5 | 101243132331111310123 |
6 | 555411510221121101 |
7 | 30235243451052235 |
oct | 2703670345674275 |
9 | 438080564530511 |
10 | 101420344244413 |
11 | 2a3521433373a7 |
12 | b45bb380b9191 |
13 | 4478b88846c5c |
14 | 1b08ab1312cc5 |
15 | bad2989e8aad |
hex | 5c3dc39778bd |
101420344244413 has 8 divisors (see below), whose sum is σ = 101921272689600. Its totient is φ = 100920408721440.
The previous prime is 101420344244407. The next prime is 101420344244447. The reversal of 101420344244413 is 314442443024101.
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 101420344244413 - 245 = 66235972155581 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101420344244473) 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, 248025763 + ... + 248434336.
It is an arithmetic number, because the mean of its divisors is an integer number (12740159086200).
Almost surely, 2101420344244413 is an apocalyptic number.
It is an amenable number.
101420344244413 is a deficient number, since it is larger than the sum of its proper divisors (500928445187).
101420344244413 is an equidigital number, since it uses as much as digits as its factorization.
101420344244413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 496461107.
The product of its (nonzero) digits is 147456, while the sum is 37.
Adding to 101420344244413 its reverse (314442443024101), we get a palindrome (415862787268514).
The spelling of 101420344244413 in words is "one hundred one trillion, four hundred twenty billion, three hundred forty-four million, two hundred forty-four thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •