Base | Representation |
---|---|
bin | 100101111101011111… |
… | …111100000110110000 |
3 | 10220012122120020110000 |
4 | 211331133330012300 |
5 | 1131434104332240 |
6 | 30420333110000 |
7 | 2642035145505 |
oct | 457537740660 |
9 | 126178506400 |
10 | 40760230320 |
11 | 163170a6367 |
12 | 7a96628300 |
13 | 3ac771c6a4 |
14 | 1d895434ac |
15 | 10d8605430 |
hex | 97d7fc1b0 |
40760230320 has 400 divisors, whose sum is σ = 150597548640. Its totient is φ = 10188177408.
The previous prime is 40760230267. The next prime is 40760230331. The reversal of 40760230320 is 2303206704.
40760230320 is a `hidden beast` number, since 4 + 0 + 7 + 602 + 30 + 3 + 20 = 666.
It is a super-2 number, since 2×407602303202 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 11940934 + ... + 11944346.
Almost surely, 240760230320 is an apocalyptic number.
40760230320 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 40760230320, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (75298774320).
40760230320 is an abundant number, since it is smaller than the sum of its proper divisors (109837318320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40760230320 is a wasteful number, since it uses less digits than its factorization.
40760230320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3554 (or 3539 counting only the distinct ones).
The product of its (nonzero) digits is 6048, while the sum is 27.
The spelling of 40760230320 in words is "forty billion, seven hundred sixty million, two hundred thirty thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •