Base | Representation |
---|---|
bin | 10111000011101110110000… |
… | …010010011100001101010101 |
3 | 111022001211121221201100101202 |
4 | 113003232300102130031111 |
5 | 101243011102143400010 |
6 | 555403433515402245 |
7 | 30234506533051364 |
oct | 2703566022341525 |
9 | 438054557640352 |
10 | 101411430450005 |
11 | 2a349389775765 |
12 | b45a26aa53385 |
13 | 4478097bba7b0 |
14 | 1b084a753b7db |
15 | bace261996a5 |
hex | 5c3bb049c355 |
101411430450005 has 32 divisors (see below), whose sum is σ = 146067237792000. Its totient is φ = 66773594391552.
The previous prime is 101411430449993. The next prime is 101411430450041. The reversal of 101411430450005 is 500054034114101.
It is a cyclic number.
It is not a de Polignac number, because 101411430450005 - 230 = 101410356708181 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101411430450005.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2415111905 + ... + 2415153894.
It is an arithmetic number, because the mean of its divisors is an integer number (4564601181000).
Almost surely, 2101411430450005 is an apocalyptic number.
It is an amenable number.
101411430450005 is a deficient number, since it is larger than the sum of its proper divisors (44655807341995).
101411430450005 is a wasteful number, since it uses less digits than its factorization.
101411430450005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4830265853.
The product of its (nonzero) digits is 4800, while the sum is 29.
Adding to 101411430450005 its reverse (500054034114101), we get a palindrome (601465464564106).
The spelling of 101411430450005 in words is "one hundred one trillion, four hundred eleven billion, four hundred thirty million, four hundred fifty thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •