Base | Representation |
---|---|
bin | 1000101100011100000… |
… | …0001100100110001000 |
3 | 112021112200111112220020 |
4 | 2023013000030212020 |
5 | 4421401101340030 |
6 | 152341334100440 |
7 | 13535316461631 |
oct | 2130700144610 |
9 | 467480445806 |
10 | 149367605640 |
11 | 5838a134990 |
12 | 24b46aaa720 |
13 | 11115550b06 |
14 | 732d7b4888 |
15 | 3d43313510 |
hex | 22c700c988 |
149367605640 has 64 divisors (see below), whose sum is σ = 488839440960. Its totient is φ = 36210328320.
The previous prime is 149367605623. The next prime is 149367605657. The reversal of 149367605640 is 46506763941.
It is an interprime number because it is at equal distance from previous prime (149367605623) and next prime (149367605657).
It is a super-2 number, since 2×1493676056402 (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 (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 56577319 + ... + 56579958.
It is an arithmetic number, because the mean of its divisors is an integer number (7638116265).
Almost surely, 2149367605640 is an apocalyptic number.
149367605640 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
149367605640 is an abundant number, since it is smaller than the sum of its proper divisors (339471835320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
149367605640 is a wasteful number, since it uses less digits than its factorization.
149367605640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113157302 (or 113157298 counting only the distinct ones).
The product of its (nonzero) digits is 3265920, while the sum is 51.
The spelling of 149367605640 in words is "one hundred forty-nine billion, three hundred sixty-seven million, six hundred five thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •