Base | Representation |
---|---|
bin | 101111100001000110… |
… | …0111111101001010010 |
3 | 100202101111211202011020 |
4 | 1133002030333221102 |
5 | 3132440330343010 |
6 | 114513323300310 |
7 | 10241464243650 |
oct | 1370214775122 |
9 | 322344752136 |
10 | 102042434130 |
11 | 3a30432609a |
12 | 1793997a696 |
13 | 98129c3550 |
14 | 4d20403dd0 |
15 | 29c36d0470 |
hex | 17c233fa52 |
102042434130 has 128 divisors (see below), whose sum is σ = 304402807296. Its totient is φ = 21316608000.
The previous prime is 102042434107. The next prime is 102042434167. The reversal of 102042434130 is 31434240201.
It is a self number, because there is not a number n which added to its sum of digits gives 102042434130.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 90690 + ... + 460770.
It is an arithmetic number, because the mean of its divisors is an integer number (2378146932).
Almost surely, 2102042434130 is an apocalyptic number.
102042434130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 102042434130, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (152201403648).
102042434130 is an abundant number, since it is smaller than the sum of its proper divisors (202360373166).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102042434130 is a wasteful number, since it uses less digits than its factorization.
102042434130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 370212.
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 102042434130 its reverse (31434240201), we get a palindrome (133476674331).
The spelling of 102042434130 in words is "one hundred two billion, forty-two million, four hundred thirty-four thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •