Base | Representation |
---|---|
bin | 101111100001010101… |
… | …0100000000100101111 |
3 | 100202102001101201120220 |
4 | 1133002222200010233 |
5 | 3132444320403020 |
6 | 114514201142423 |
7 | 10241620060665 |
oct | 1370252400457 |
9 | 322361351526 |
10 | 102050169135 |
11 | 3a308729562 |
12 | 1794048aa13 |
13 | 98144a1185 |
14 | 4d21458c35 |
15 | 29c420c240 |
hex | 17c2aa012f |
102050169135 has 32 divisors (see below), whose sum is σ = 163762034688. Its totient is φ = 54266378880.
The previous prime is 102050169131. The next prime is 102050169149. The reversal of 102050169135 is 531961050201.
It is not a de Polignac number, because 102050169135 - 22 = 102050169131 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102050169096 and 102050169105.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102050169131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8928034 + ... + 8939456.
It is an arithmetic number, because the mean of its divisors is an integer number (5117563584).
Almost surely, 2102050169135 is an apocalyptic number.
102050169135 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
102050169135 is a deficient number, since it is larger than the sum of its proper divisors (61711865553).
102050169135 is a wasteful number, since it uses less digits than its factorization.
102050169135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13135.
The product of its (nonzero) digits is 8100, while the sum is 33.
The spelling of 102050169135 in words is "one hundred two billion, fifty million, one hundred sixty-nine thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •