Base | Representation |
---|---|
bin | 100101011001010000… |
… | …000111110101101100 |
3 | 10211122021021020101002 |
4 | 211121100013311230 |
5 | 1124212414314200 |
6 | 30240130535432 |
7 | 2621002153400 |
oct | 453120076554 |
9 | 124567236332 |
10 | 40152104300 |
11 | 160348a8280 |
12 | 7946a37578 |
13 | 3a2b73a1c9 |
14 | 1d2c883100 |
15 | 10a002ebd5 |
hex | 959407d6c |
40152104300 has 216 divisors, whose sum is σ = 111086483760. Its totient is φ = 12456460800.
The previous prime is 40152104257. The next prime is 40152104327. The reversal of 40152104300 is 340125104.
It is a super-2 number, since 2×401521043002 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
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 71 ways as a sum of consecutive naturals, for example, 12341474 + ... + 12344726.
Almost surely, 240152104300 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 40152104300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (55543241880).
40152104300 is an abundant number, since it is smaller than the sum of its proper divisors (70934379460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40152104300 is a wasteful number, since it uses less digits than its factorization.
40152104300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3521 (or 3507 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 20.
Adding to 40152104300 its reverse (340125104), we get a palindrome (40492229404).
The spelling of 40152104300 in words is "forty billion, one hundred fifty-two million, one hundred four thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •