Base | Representation |
---|---|
bin | 100101001100100001101… |
… | …0111111110110111000100 |
3 | 200002201022221000122122110 |
4 | 1022121003113332313010 |
5 | 1132224131202130000 |
6 | 14512252500501020 |
7 | 1035224426203161 |
oct | 112310327766704 |
9 | 20081287018573 |
10 | 5112141442500 |
11 | 16a1057631064 |
12 | 6a69259aa770 |
13 | 2b10c412c2c1 |
14 | 139601123068 |
15 | 8cea281a850 |
hex | 4a6435fedc4 |
5112141442500 has 120 divisors (see below), whose sum is σ = 15782444026272. Its totient is φ = 1283047232000.
The previous prime is 5112141442469. The next prime is 5112141442567. The reversal of 5112141442500 is 52441412115.
It is a super-2 number, since 2×51121414425002 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 19920114 + ... + 20175113.
Almost surely, 25112141442500 is an apocalyptic number.
5112141442500 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5112141442500 is an abundant number, since it is smaller than the sum of its proper divisors (10670302583772).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5112141442500 is a wasteful number, since it uses less digits than its factorization.
5112141442500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40095271 (or 40095254 counting only the distinct ones).
The product of its (nonzero) digits is 6400, while the sum is 30.
Adding to 5112141442500 its reverse (52441412115), we get a palindrome (5164582854615).
The spelling of 5112141442500 in words is "five trillion, one hundred twelve billion, one hundred forty-one million, four hundred forty-two thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •