Base | Representation |
---|---|
bin | 100101010011011010… |
… | …000101100101010100 |
3 | 10211101102202201120000 |
4 | 211103122011211110 |
5 | 1124012314200304 |
6 | 30222305211300 |
7 | 2615401556214 |
oct | 452332054524 |
9 | 124342681500 |
10 | 40054053204 |
11 | 15a94518010 |
12 | 791a030b30 |
13 | 3a143297c9 |
14 | 1d1d83c244 |
15 | 1096612939 |
hex | 953685954 |
40054053204 has 120 divisors (see below), whose sum is σ = 114297351168. Its totient is φ = 12130248960.
The previous prime is 40054053157. The next prime is 40054053217. The reversal of 40054053204 is 40235045004.
40054053204 is a `hidden beast` number, since 400 + 5 + 4 + 0 + 53 + 204 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 10094829 + ... + 10098795.
Almost surely, 240054053204 is an apocalyptic number.
40054053204 is a gapful number since it is divisible by the number (44) 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 40054053204, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (57148675584).
40054053204 is an abundant number, since it is smaller than the sum of its proper divisors (74243297964).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40054053204 is a wasteful number, since it uses less digits than its factorization.
40054053204 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6827 (or 6816 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 27.
Adding to 40054053204 its reverse (40235045004), we get a palindrome (80289098208).
The spelling of 40054053204 in words is "forty billion, fifty-four million, fifty-three thousand, two hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •