Base | Representation |
---|---|
bin | 101111100011011110… |
… | …1101101010100110100 |
3 | 100202121002011000101100 |
4 | 1133012331231110310 |
5 | 3133121303004022 |
6 | 114525255330100 |
7 | 10243454223666 |
oct | 1370675552464 |
9 | 322532130340 |
10 | 102122313012 |
11 | 3a3454242a5 |
12 | 17960680930 |
13 | 9826410765 |
14 | 4d2ac78536 |
15 | 29ca70d1ac |
hex | 17c6f6d534 |
102122313012 has 36 divisors (see below), whose sum is σ = 258582332736. Its totient is φ = 33982772880.
The previous prime is 102122312987. The next prime is 102122313017. The reversal of 102122313012 is 210313221201.
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102122313017) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2395164 + ... + 2437427.
It is an arithmetic number, because the mean of its divisors is an integer number (7182842576).
Almost surely, 2102122313012 is an apocalyptic number.
102122313012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102122313012 is an abundant number, since it is smaller than the sum of its proper divisors (156460019724).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102122313012 is a wasteful number, since it uses less digits than its factorization.
102122313012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4833188 (or 4833183 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 102122313012 its reverse (210313221201), we get a palindrome (312435534213).
The spelling of 102122313012 in words is "one hundred two billion, one hundred twenty-two million, three hundred thirteen thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •