Base | Representation |
---|---|
bin | 100101101000110000… |
… | …000101001001100101 |
3 | 10212022101120102110212 |
4 | 211220300011021211 |
5 | 1130231001441013 |
6 | 30322020225205 |
7 | 2630310344351 |
oct | 455060051145 |
9 | 125271512425 |
10 | 40412140133 |
11 | 16158666022 |
12 | 79b9b3b205 |
13 | 3a70584871 |
14 | 1d55212461 |
15 | 10b7c976a8 |
hex | 968c05265 |
40412140133 has 8 divisors (see below), whose sum is σ = 42452208000. Its totient is φ = 38395657168.
The previous prime is 40412140127. The next prime is 40412140141. The reversal of 40412140133 is 33104121404.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 40412140133 - 28 = 40412139877 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 40412140099 and 40412140108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40412140103) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5892713 + ... + 5899566.
It is an arithmetic number, because the mean of its divisors is an integer number (5306526000).
Almost surely, 240412140133 is an apocalyptic number.
It is an amenable number.
40412140133 is a deficient number, since it is larger than the sum of its proper divisors (2040067867).
40412140133 is a wasteful number, since it uses less digits than its factorization.
40412140133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11792451.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 40412140133 its reverse (33104121404), we get a palindrome (73516261537).
The spelling of 40412140133 in words is "forty billion, four hundred twelve million, one hundred forty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •