Base | Representation |
---|---|
bin | 101111100000010010… |
… | …0100010000101110101 |
3 | 100202022121022111022221 |
4 | 1133000210202011311 |
5 | 3132411323100401 |
6 | 114510504322341 |
7 | 10241012422066 |
oct | 1370044420565 |
9 | 322277274287 |
10 | 102015050101 |
11 | 3a29a922068 |
12 | 179307733b1 |
13 | 980a126193 |
14 | 4d1a91656d |
15 | 29c10c17a1 |
hex | 17c0922175 |
102015050101 has 4 divisors (see below), whose sum is σ = 103025100204. Its totient is φ = 101005000000.
The previous prime is 102015049973. The next prime is 102015050141. The reversal of 102015050101 is 101050510201.
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 51529454001 + 50485596100 = 227001^2 + 224690^2 .
It is a cyclic number.
It is not a de Polignac number, because 102015050101 - 27 = 102015049973 is a prime.
It is a super-2 number, since 2×1020150501012 (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 (102015050141) 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, 505024900 + ... + 505025101.
It is an arithmetic number, because the mean of its divisors is an integer number (25756275051).
Almost surely, 2102015050101 is an apocalyptic number.
It is an amenable number.
102015050101 is a deficient number, since it is larger than the sum of its proper divisors (1010050103).
102015050101 is a wasteful number, since it uses less digits than its factorization.
102015050101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1010050102.
The product of its (nonzero) digits is 50, while the sum is 16.
Adding to 102015050101 its reverse (101050510201), we get a palindrome (203065560302).
The spelling of 102015050101 in words is "one hundred two billion, fifteen million, fifty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •