Base | Representation |
---|---|
bin | 10111000000101011001010… |
… | …101111111110111000010111 |
3 | 111021022202120000220010201110 |
4 | 113000223022233332320113 |
5 | 101231041002234114221 |
6 | 555123142504230103 |
7 | 30213363361162065 |
oct | 2700531257767027 |
9 | 437282500803643 |
10 | 101201421004311 |
11 | 2a2783109288a1 |
12 | b42561b16b333 |
13 | 4461339c549b4 |
14 | 1adc263d59035 |
15 | ba77340ed776 |
hex | 5c0acabfee17 |
101201421004311 has 32 divisors (see below), whose sum is σ = 139456550514688. Its totient is φ = 65212244536320.
The previous prime is 101201421004301. The next prime is 101201421004319. The reversal of 101201421004311 is 113400124102101.
It is not a de Polignac number, because 101201421004311 - 25 = 101201421004279 is a prime.
It is a super-3 number, since 3×1012014210043113 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101201421004319) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 526629801 + ... + 526821933.
It is an arithmetic number, because the mean of its divisors is an integer number (4358017203584).
Almost surely, 2101201421004311 is an apocalyptic number.
101201421004311 is a deficient number, since it is larger than the sum of its proper divisors (38255129510377).
101201421004311 is a wasteful number, since it uses less digits than its factorization.
101201421004311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 198991.
The product of its (nonzero) digits is 192, while the sum is 21.
Adding to 101201421004311 its reverse (113400124102101), we get a palindrome (214601545106412).
The spelling of 101201421004311 in words is "one hundred one trillion, two hundred one billion, four hundred twenty-one million, four thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •