Base | Representation |
---|---|
bin | 101111100011101111… |
… | …1110100101110010111 |
3 | 100202121200222101011002 |
4 | 1133013133310232113 |
5 | 3133131100144330 |
6 | 114530215133515 |
7 | 10243623232322 |
oct | 1370737645627 |
9 | 322550871132 |
10 | 102131256215 |
11 | 3a34a48247a |
12 | 1796367429b |
13 | 98282222b1 |
14 | 4d2c1257b9 |
15 | 29cb3c7e45 |
hex | 17c77f4b97 |
102131256215 has 4 divisors (see below), whose sum is σ = 122557507464. Its totient is φ = 81705004968.
The previous prime is 102131256211. The next prime is 102131256233. The reversal of 102131256215 is 512652131201.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 512652131201 = 7 ⋅73236018743.
It is a cyclic number.
It is not a de Polignac number, because 102131256215 - 22 = 102131256211 is a prime.
It is a super-2 number, since 2×1021312562152 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102131256211) 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, 10213125617 + ... + 10213125626.
It is an arithmetic number, because the mean of its divisors is an integer number (30639376866).
Almost surely, 2102131256215 is an apocalyptic number.
102131256215 is a deficient number, since it is larger than the sum of its proper divisors (20426251249).
102131256215 is an equidigital number, since it uses as much as digits as its factorization.
102131256215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20426251248.
The product of its (nonzero) digits is 3600, while the sum is 29.
Adding to 102131256215 its reverse (512652131201), we get a palindrome (614783387416).
The spelling of 102131256215 in words is "one hundred two billion, one hundred thirty-one million, two hundred fifty-six thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •