Base | Representation |
---|---|
bin | 10111011011001100110010… |
… | …110101100110101101010010 |
3 | 111111210000112222002012211112 |
4 | 113123030302311212231102 |
5 | 102000422112230122010 |
6 | 1003040402433013322 |
7 | 30462153355230200 |
oct | 2733146265465522 |
9 | 444700488065745 |
10 | 103024233442130 |
11 | 2a910371a3a680 |
12 | b67a9533b4242 |
13 | 45641b3438100 |
14 | 1b62584350070 |
15 | bd9d6b767a05 |
hex | 5db332d66b52 |
103024233442130 has 144 divisors (see below), whose sum is σ = 254825932665024. Its totient is φ = 29641337631360.
The previous prime is 103024233442121. The next prime is 103024233442171. The reversal of 103024233442130 is 31244332420301.
It is a super-2 number, since 2×1030242334421302 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 55639262 + ... + 57461081.
It is an arithmetic number, because the mean of its divisors is an integer number (1769624532396).
Almost surely, 2103024233442130 is an apocalyptic number.
103024233442130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
103024233442130 is an abundant number, since it is smaller than the sum of its proper divisors (151801699222894).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103024233442130 is a wasteful number, since it uses less digits than its factorization.
103024233442130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 113100401 (or 113100381 counting only the distinct ones).
The product of its (nonzero) digits is 41472, while the sum is 32.
Adding to 103024233442130 its reverse (31244332420301), we get a palindrome (134268565862431).
The spelling of 103024233442130 in words is "one hundred three trillion, twenty-four billion, two hundred thirty-three million, four hundred forty-two thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •