Base | Representation |
---|---|
bin | 100101011000001000… |
… | …011100001000000000 |
3 | 10211120221220112120220 |
4 | 211120020130020000 |
5 | 1124143112004044 |
6 | 30234220103040 |
7 | 2620353350340 |
oct | 453010341000 |
9 | 124527815526 |
10 | 40133313024 |
11 | 160252330a2 |
12 | 7940694a80 |
13 | 3a2788accc |
14 | 1d2a190d20 |
15 | 109d56c019 |
hex | 95821c200 |
40133313024 has 160 divisors (see below), whose sum is σ = 124017586176. Its totient is φ = 11295313920.
The previous prime is 40133313001. The next prime is 40133313037. The reversal of 40133313024 is 42031333104.
It is a super-2 number, since 2×401333130242 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 40133312985 and 40133313003.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 692529 + ... + 748239.
Almost surely, 240133313024 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 40133313024, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (62008793088).
40133313024 is an abundant number, since it is smaller than the sum of its proper divisors (83884273152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40133313024 is an equidigital number, since it uses as much as digits as its factorization.
40133313024 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55806 (or 55790 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 40133313024 its reverse (42031333104), we get a palindrome (82164646128).
The spelling of 40133313024 in words is "forty billion, one hundred thirty-three million, three hundred thirteen thousand, twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •