Base | Representation |
---|---|
bin | 1000011110100011011… |
… | …1010100010100001010 |
3 | 111220220221201221212201 |
4 | 2013220313110110022 |
5 | 4341233012023020 |
6 | 150523442230414 |
7 | 13344053554540 |
oct | 2075067242412 |
9 | 456827657781 |
10 | 145640736010 |
11 | 56847442640 |
12 | 2428695540a |
13 | 109703b0003 |
14 | 709883bd90 |
15 | 3bc6040a0a |
hex | 21e8dd450a |
145640736010 has 64 divisors (see below), whose sum is σ = 326939224320. Its totient is φ = 45380805120.
The previous prime is 145640735983. The next prime is 145640736041. The reversal of 145640736010 is 10637046541.
It is a super-2 number, since 2×1456407360102 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 2690532 + ... + 2744128.
It is an arithmetic number, because the mean of its divisors is an integer number (5108425380).
Almost surely, 2145640736010 is an apocalyptic number.
145640736010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
145640736010 is an abundant number, since it is smaller than the sum of its proper divisors (181298488310).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145640736010 is a wasteful number, since it uses less digits than its factorization.
145640736010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57151.
The product of its (nonzero) digits is 60480, while the sum is 37.
The spelling of 145640736010 in words is "one hundred forty-five billion, six hundred forty million, seven hundred thirty-six thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.616 sec. • engine limits •