Base | Representation |
---|---|
bin | 10111010011110001100111… |
… | …110100110010001111001011 |
3 | 111102222020121101221111212020 |
4 | 113103301213310302033023 |
5 | 101414042203423431220 |
6 | 1002010142524215523 |
7 | 30410252004535656 |
oct | 2723614764621713 |
9 | 442866541844766 |
10 | 102514021311435 |
11 | 2a733a5254a248 |
12 | b5b7aa239a5a3 |
13 | 4528052689266 |
14 | 1b459c2b4889d |
15 | bcb959323040 |
hex | 5d3c67d323cb |
102514021311435 has 128 divisors (see below), whose sum is σ = 177123295641600. Its totient is φ = 50466212628480.
The previous prime is 102514021311433. The next prime is 102514021311469. The reversal of 102514021311435 is 534113120415201.
It is not a de Polignac number, because 102514021311435 - 21 = 102514021311433 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102514021311396 and 102514021311405.
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 127 ways as a sum of consecutive naturals, for example, 17261155696 + ... + 17261161634.
It is an arithmetic number, because the mean of its divisors is an integer number (1383775747200).
Almost surely, 2102514021311435 is an apocalyptic number.
102514021311435 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
102514021311435 is a deficient number, since it is larger than the sum of its proper divisors (74609274330165).
102514021311435 is a wasteful number, since it uses less digits than its factorization.
102514021311435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11601.
The product of its (nonzero) digits is 14400, while the sum is 33.
Adding to 102514021311435 its reverse (534113120415201), we get a palindrome (636627141726636).
The spelling of 102514021311435 in words is "one hundred two trillion, five hundred fourteen billion, twenty-one million, three hundred eleven thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •