Base | Representation |
---|---|
bin | 10111010011110000010110… |
… | …011001100100110111100100 |
3 | 111102222010002012102002121010 |
4 | 113103300112121210313210 |
5 | 101414031404214134132 |
6 | 1002005355204222220 |
7 | 30410203106146425 |
oct | 2723602631446744 |
9 | 442863065362533 |
10 | 102512655224292 |
11 | 2a733411413805 |
12 | b5b778099a970 |
13 | 4527b95652781 |
14 | 1b458d354364c |
15 | bcb8c942b6cc |
hex | 5d3c16664de4 |
102512655224292 has 48 divisors (see below), whose sum is σ = 240816065559552. Its totient is φ = 33939794046240.
The previous prime is 102512655224249. The next prime is 102512655224293. The reversal of 102512655224292 is 292422556215201.
It is a super-2 number, since 2×1025126552242922 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (102512655224293) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 17364184 + ... + 22506447.
It is an arithmetic number, because the mean of its divisors is an integer number (5017001365824).
Almost surely, 2102512655224292 is an apocalyptic number.
102512655224292 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102512655224292 is an abundant number, since it is smaller than the sum of its proper divisors (138303410335260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102512655224292 is a wasteful number, since it uses less digits than its factorization.
102512655224292 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39872088 (or 39872086 counting only the distinct ones).
The product of its (nonzero) digits is 1728000, while the sum is 48.
The spelling of 102512655224292 in words is "one hundred two trillion, five hundred twelve billion, six hundred fifty-five million, two hundred twenty-four thousand, two hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •