Base | Representation |
---|---|
bin | 10111010011110001100111… |
… | …110100110010001111001010 |
3 | 111102222020121101221111212012 |
4 | 113103301213310302033022 |
5 | 101414042203423431214 |
6 | 1002010142524215522 |
7 | 30410252004535655 |
oct | 2723614764621712 |
9 | 442866541844765 |
10 | 102514021311434 |
11 | 2a733a5254a247 |
12 | b5b7aa239a5a2 |
13 | 4528052689265 |
14 | 1b459c2b4889c |
15 | bcb95932303e |
hex | 5d3c67d323ca |
102514021311434 has 8 divisors (see below), whose sum is σ = 153771093020448. Its totient is φ = 51256990304620.
The previous prime is 102514021311433. The next prime is 102514021311469. The reversal of 102514021311434 is 434113120415201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1025140213114342 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 102514021311434.
It is not an unprimeable number, because it can be changed into a prime (102514021311431) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2813732 + ... + 14592639.
It is an arithmetic number, because the mean of its divisors is an integer number (19221386627556).
Almost surely, 2102514021311434 is an apocalyptic number.
102514021311434 is a deficient number, since it is larger than the sum of its proper divisors (51257071709014).
102514021311434 is a wasteful number, since it uses less digits than its factorization.
102514021311434 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20351100.
The product of its (nonzero) digits is 11520, while the sum is 32.
Adding to 102514021311434 its reverse (434113120415201), we get a palindrome (536627141726635).
The spelling of 102514021311434 in words is "one hundred two trillion, five hundred fourteen billion, twenty-one million, three hundred eleven thousand, four hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.151 sec. • engine limits •