Base | Representation |
---|---|
bin | 100101010111111101… |
… | …101110101011011000 |
3 | 10211120202121220022000 |
4 | 211113331232223120 |
5 | 1124141402133212 |
6 | 30234040001000 |
7 | 2620320445053 |
oct | 452775565330 |
9 | 124522556260 |
10 | 40130505432 |
11 | 16023695776 |
12 | 793b760160 |
13 | 3a27117104 |
14 | 1d29a5da9a |
15 | 109d1b51dc |
hex | 957f6ead8 |
40130505432 has 64 divisors (see below), whose sum is σ = 116320320000. Its totient is φ = 12795232032.
The previous prime is 40130505431. The next prime is 40130505461. The reversal of 40130505432 is 23450503104.
40130505432 is a `hidden beast` number, since 40 + 1 + 30 + 50 + 543 + 2 = 666.
It is a super-2 number, since 2×401305054322 (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 a junction number, because it is equal to n+sod(n) for n = 40130505396 and 40130505405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40130505431) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4033932 + ... + 4043867.
It is an arithmetic number, because the mean of its divisors is an integer number (1817505000).
Almost surely, 240130505432 is an apocalyptic number.
It is an amenable number.
40130505432 is an abundant number, since it is smaller than the sum of its proper divisors (76189814568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40130505432 is a wasteful number, since it uses less digits than its factorization.
40130505432 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8077837 (or 8077827 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 27.
The spelling of 40130505432 in words is "forty billion, one hundred thirty million, five hundred five thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •