Base | Representation |
---|---|
bin | 101111100000010010… |
… | …0100011010100000001 |
3 | 100202022121022202012021 |
4 | 1133000210203110001 |
5 | 3132411323230410 |
6 | 114510504401441 |
7 | 10241012442505 |
oct | 1370044432401 |
9 | 322277282167 |
10 | 102015055105 |
11 | 3a29a9258a7 |
12 | 17930776281 |
13 | 980a128542 |
14 | 4d1a918305 |
15 | 29c10c2eda |
hex | 17c0923501 |
102015055105 has 4 divisors (see below), whose sum is σ = 122418066132. Its totient is φ = 81612044080.
The previous prime is 102015055049. The next prime is 102015055139. The reversal of 102015055105 is 501550510201.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 34631721216 + 67383333889 = 186096^2 + 259583^2 .
It is not a de Polignac number, because 102015055105 - 29 = 102015054593 is a prime.
It is a super-2 number, since 2×1020150551052 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 102015055105.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10201505506 + ... + 10201505515.
It is an arithmetic number, because the mean of its divisors is an integer number (30604516533).
Almost surely, 2102015055105 is an apocalyptic number.
It is an amenable number.
102015055105 is a deficient number, since it is larger than the sum of its proper divisors (20403011027).
102015055105 is an equidigital number, since it uses as much as digits as its factorization.
102015055105 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20403011026.
The product of its (nonzero) digits is 1250, while the sum is 25.
Adding to 102015055105 its reverse (501550510201), we get a palindrome (603565565306).
The spelling of 102015055105 in words is "one hundred two billion, fifteen million, fifty-five thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •