Base | Representation |
---|---|
bin | 1000110011111000000… |
… | …0011101100111001000 |
3 | 112110200211101020010122 |
4 | 2030332000131213020 |
5 | 4434443211222130 |
6 | 153311415202412 |
7 | 13635642110615 |
oct | 2147600354710 |
9 | 473624336118 |
10 | 151364164040 |
11 | 59214140851 |
12 | 25403676408 |
13 | 1137309180b |
14 | 747ca1550c |
15 | 3e0d7462e5 |
hex | 233e01d9c8 |
151364164040 has 64 divisors (see below), whose sum is σ = 342489772800. Its totient is φ = 60204552192.
The previous prime is 151364164037. The next prime is 151364164051. The reversal of 151364164040 is 40461463151.
It is a super-2 number, since 2×1513641640402 (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 15 ways as a sum of consecutive naturals, for example, 30252179 + ... + 30257181.
It is an arithmetic number, because the mean of its divisors is an integer number (5351402700).
Almost surely, 2151364164040 is an apocalyptic number.
151364164040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
151364164040 is an abundant number, since it is smaller than the sum of its proper divisors (191125608760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
151364164040 is a wasteful number, since it uses less digits than its factorization.
151364164040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9126 (or 9122 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 35.
The spelling of 151364164040 in words is "one hundred fifty-one billion, three hundred sixty-four million, one hundred sixty-four thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •