Base | Representation |
---|---|
bin | 10111001101111101011110… |
… | …010101011001100011101011 |
3 | 111101120001012012122022001222 |
4 | 113031331132111121203223 |
5 | 101341020323103133121 |
6 | 1001102415510332255 |
7 | 30336344525540006 |
oct | 2715753625314353 |
9 | 441501165568058 |
10 | 102114430130411 |
11 | 2a59a539766676 |
12 | b55256405a08b |
13 | 44c947095964a |
14 | 1b30516da453d |
15 | bc136d7810ab |
hex | 5cdf5e5598eb |
102114430130411 has 8 divisors (see below), whose sum is σ = 106554566603520. Its totient is φ = 97674325210792.
The previous prime is 102114430130407. The next prime is 102114430130429. The reversal of 102114430130411 is 114031034411201.
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 102114430130411 - 22 = 102114430130407 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102114430130441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1152815 + ... + 14337288.
It is an arithmetic number, because the mean of its divisors is an integer number (13319320825440).
Almost surely, 2102114430130411 is an apocalyptic number.
102114430130411 is a deficient number, since it is larger than the sum of its proper divisors (4440136473109).
102114430130411 is a wasteful number, since it uses less digits than its factorization.
102114430130411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15776745.
The product of its (nonzero) digits is 1152, while the sum is 26.
Adding to 102114430130411 its reverse (114031034411201), we get a palindrome (216145464541612).
The spelling of 102114430130411 in words is "one hundred two trillion, one hundred fourteen billion, four hundred thirty million, one hundred thirty thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •