Base | Representation |
---|---|
bin | 101111101010010100… |
… | …0001011011011001000 |
3 | 100210012001111110121210 |
4 | 1133110220023123020 |
5 | 3134103444101102 |
6 | 115004124533120 |
7 | 10252236551565 |
oct | 1372450133310 |
9 | 323161443553 |
10 | 102351550152 |
11 | 3a452866585 |
12 | 17a053b11a0 |
13 | 9861a63737 |
14 | 4d4d4ab86c |
15 | 29e08e036c |
hex | 17d4a0b6c8 |
102351550152 has 128 divisors (see below), whose sum is σ = 264528633600. Its totient is φ = 32980684800.
The previous prime is 102351550139. The next prime is 102351550211. The reversal of 102351550152 is 251055153201.
It is a super-3 number, since 3×1023515501523 (a number of 34 digits) contains 333 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 54470349 + ... + 54472227.
It is an arithmetic number, because the mean of its divisors is an integer number (2066629950).
Almost surely, 2102351550152 is an apocalyptic number.
102351550152 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 102351550152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (132264316800).
102351550152 is an abundant number, since it is smaller than the sum of its proper divisors (162177083448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102351550152 is a wasteful number, since it uses less digits than its factorization.
102351550152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2407 (or 2403 counting only the distinct ones).
The product of its (nonzero) digits is 7500, while the sum is 30.
The spelling of 102351550152 in words is "one hundred two billion, three hundred fifty-one million, five hundred fifty thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •