Base | Representation |
---|---|
bin | 101111100111011100… |
… | …1000100100100001101 |
3 | 100202221100102020002210 |
4 | 1133032321010210031 |
5 | 3133404330041323 |
6 | 114550410141033 |
7 | 10246660560342 |
oct | 1371671044415 |
9 | 322840366083 |
10 | 102255315213 |
11 | 3a403506877 |
12 | 17999121779 |
13 | 9847b3a89c |
14 | 4d407ba7c9 |
15 | 29d7231293 |
hex | 17cee4490d |
102255315213 has 8 divisors (see below), whose sum is σ = 136345785408. Its totient is φ = 68167527584.
The previous prime is 102255315199. The next prime is 102255315229. The reversal of 102255315213 is 312513552201.
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 102255315213 - 25 = 102255315181 is a prime.
It is a super-2 number, since 2×1022553152132 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102255315293) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 579945 + ... + 735422.
It is an arithmetic number, because the mean of its divisors is an integer number (17043223176).
Almost surely, 2102255315213 is an apocalyptic number.
It is an amenable number.
102255315213 is a deficient number, since it is larger than the sum of its proper divisors (34090470195).
102255315213 is a wasteful number, since it uses less digits than its factorization.
102255315213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1341283.
The product of its (nonzero) digits is 9000, while the sum is 30.
Adding to 102255315213 its reverse (312513552201), we get a palindrome (414768867414).
The spelling of 102255315213 in words is "one hundred two billion, two hundred fifty-five million, three hundred fifteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •