Base | Representation |
---|---|
bin | 101111100000011011… |
… | …1011101000010100110 |
3 | 100202022221122111020110 |
4 | 1133000313131002212 |
5 | 3132414110311100 |
6 | 114511202513450 |
7 | 10241102530632 |
oct | 1370067350246 |
9 | 322287574213 |
10 | 102020010150 |
11 | 3a2a26aa683 |
12 | 17932365886 |
13 | 980b171a16 |
14 | 4d1b447dc2 |
15 | 29c1751250 |
hex | 17c0ddd0a6 |
102020010150 has 48 divisors (see below), whose sum is σ = 253042357824. Its totient is φ = 27201816480.
The previous prime is 102020010133. The next prime is 102020010151. The reversal of 102020010150 is 51010020201.
It is a super-2 number, since 2×1020200101502 (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 (102020010151) 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 23 ways as a sum of consecutive naturals, for example, 1244737 + ... + 1324163.
It is an arithmetic number, because the mean of its divisors is an integer number (5271715788).
Almost surely, 2102020010150 is an apocalyptic number.
102020010150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102020010150 is an abundant number, since it is smaller than the sum of its proper divisors (151022347674).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102020010150 is a wasteful number, since it uses less digits than its factorization.
102020010150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88005 (or 88000 counting only the distinct ones).
The product of its (nonzero) digits is 20, while the sum is 12.
Adding to 102020010150 its reverse (51010020201), we get a palindrome (153030030351).
The spelling of 102020010150 in words is "one hundred two billion, twenty million, ten thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •