Base | Representation |
---|---|
bin | 1000100000000111100… |
… | …0011100000001100100 |
3 | 111222000012112011010120 |
4 | 2020001320130001210 |
5 | 4343112434211012 |
6 | 151033234321540 |
7 | 13360341266166 |
oct | 2100170340144 |
9 | 458005464116 |
10 | 146060460132 |
11 | 56a4235a584 |
12 | 243834292b0 |
13 | 10a09339292 |
14 | 70d8498936 |
15 | 3becced58c |
hex | 2201e1c064 |
146060460132 has 24 divisors (see below), whose sum is σ = 341240809056. Its totient is φ = 48624953088.
The previous prime is 146060460071. The next prime is 146060460173. The reversal of 146060460132 is 231064060641.
It is a super-2 number, since 2×1460604601322 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 146060460093 and 146060460102.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7723533 + ... + 7742420.
It is an arithmetic number, because the mean of its divisors is an integer number (14218367044).
Almost surely, 2146060460132 is an apocalyptic number.
146060460132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
146060460132 is an abundant number, since it is smaller than the sum of its proper divisors (195180348924).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146060460132 is a wasteful number, since it uses less digits than its factorization.
146060460132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15466747 (or 15466745 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 33.
The spelling of 146060460132 in words is "one hundred forty-six billion, sixty million, four hundred sixty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •