Base | Representation |
---|---|
bin | 1000100000001000111… |
… | …1100011101010100100 |
3 | 111222000121221001201112 |
4 | 2020002033203222210 |
5 | 4343121012130430 |
6 | 151034012244152 |
7 | 13360443640460 |
oct | 2100217435244 |
9 | 458017831645 |
10 | 146066520740 |
11 | 56a45819a48 |
12 | 24385470658 |
13 | 10a0a67ba3a |
14 | 70d91d54a0 |
15 | 3bed5e9195 |
hex | 22023e3aa4 |
146066520740 has 192 divisors, whose sum is σ = 361454607360. Its totient is φ = 48554311680.
The previous prime is 146066520737. The next prime is 146066520749. The reversal of 146066520740 is 47025660641.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (146066520749) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 189943076 + ... + 189943844.
It is an arithmetic number, because the mean of its divisors is an integer number (1882576080).
Almost surely, 2146066520740 is an apocalyptic number.
146066520740 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 146066520740, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (180727303680).
146066520740 is an abundant number, since it is smaller than the sum of its proper divisors (215388086620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146066520740 is a wasteful number, since it uses less digits than its factorization.
146066520740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1150 (or 1148 counting only the distinct ones).
The product of its (nonzero) digits is 241920, while the sum is 41.
The spelling of 146066520740 in words is "one hundred forty-six billion, sixty-six million, five hundred twenty thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •