Base | Representation |
---|---|
bin | 100001001100101011101001… |
… | …110110100100011010001100 |
3 | 201010222010200202220022012112 |
4 | 201030223221312210122030 |
5 | 123114134410131001320 |
6 | 1234310413045123152 |
7 | 42516442413634025 |
oct | 4114535166443214 |
9 | 633863622808175 |
10 | 146007041656460 |
11 | 4258226968a396 |
12 | 144611869b94b8 |
13 | 636153589cc0a |
14 | 280aac839bc4c |
15 | 11d2ea176aec5 |
hex | 84cae9da468c |
146007041656460 has 24 divisors (see below), whose sum is σ = 306638306840880. Its totient is φ = 58398336784064.
The previous prime is 146007041656403. The next prime is 146007041656477. The reversal of 146007041656460 is 64656140700641.
It is a super-3 number, since 3×1460070416564603 (a number of 43 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 146007041656399 and 146007041656408.
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, 279725150 + ... + 280246629.
It is an arithmetic number, because the mean of its divisors is an integer number (12776596118370).
Almost surely, 2146007041656460 is an apocalyptic number.
146007041656460 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
146007041656460 is an abundant number, since it is smaller than the sum of its proper divisors (160631265184420).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
146007041656460 is a wasteful number, since it uses less digits than its factorization.
146007041656460 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 559984825 (or 559984823 counting only the distinct ones).
The product of its (nonzero) digits is 2903040, while the sum is 50.
The spelling of 146007041656460 in words is "one hundred forty-six trillion, seven billion, forty-one million, six hundred fifty-six thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •