Base | Representation |
---|---|
bin | 1000100000010101111… |
… | …1011101000110011000 |
3 | 111222011102110220101020 |
4 | 2020011133131012120 |
5 | 4343223440113200 |
6 | 151043240322440 |
7 | 13362005114040 |
oct | 2100537350630 |
9 | 458142426336 |
10 | 146121019800 |
11 | 56a73562998 |
12 | 2439b773420 |
13 | 10a18a50bc2 |
14 | 7102540720 |
15 | 3c032b1ea0 |
hex | 22057dd198 |
146121019800 has 96 divisors (see below), whose sum is σ = 517685913600. Its totient is φ = 33399089280.
The previous prime is 146121019799. The next prime is 146121019801. The reversal of 146121019800 is 8910121641.
It is an interprime number because it is at equal distance from previous prime (146121019799) and next prime (146121019801).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (146121019801) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 17391160 + ... + 17399559.
It is an arithmetic number, because the mean of its divisors is an integer number (5392561600).
Almost surely, 2146121019800 is an apocalyptic number.
146121019800 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
146121019800 is an abundant number, since it is smaller than the sum of its proper divisors (371564893800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146121019800 is a wasteful number, since it uses less digits than its factorization.
146121019800 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34790745 (or 34790736 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 33.
The spelling of 146121019800 in words is "one hundred forty-six billion, one hundred twenty-one million, nineteen thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.019 sec. • engine limits •