Base | Representation |
---|---|
bin | 100101011100110001… |
… | …010110001000001001 |
3 | 10211210101100211022000 |
4 | 211130301112020021 |
5 | 1124323023121400 |
6 | 30250040221213 |
7 | 2622320044356 |
oct | 453461261011 |
9 | 124711324260 |
10 | 40211145225 |
11 | 16065163629 |
12 | 796276a809 |
13 | 3a3aa3c774 |
14 | 1d3665162d |
15 | 10a52e3600 |
hex | 95cc56209 |
40211145225 has 96 divisors (see below), whose sum is σ = 74712718080. Its totient is φ = 21202560000.
The previous prime is 40211145223. The next prime is 40211145229. The reversal of 40211145225 is 52254111204.
It is a happy number.
40211145225 is a `hidden beast` number, since 4 + 0 + 21 + 114 + 522 + 5 = 666.
It is not a de Polignac number, because 40211145225 - 21 = 40211145223 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (40211145223) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 24563107 + ... + 24564743.
It is an arithmetic number, because the mean of its divisors is an integer number (778257480).
Almost surely, 240211145225 is an apocalyptic number.
40211145225 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
It is an amenable number.
40211145225 is a deficient number, since it is larger than the sum of its proper divisors (34501572855).
40211145225 is a wasteful number, since it uses less digits than its factorization.
40211145225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2048 (or 2037 counting only the distinct ones).
The product of its (nonzero) digits is 3200, while the sum is 27.
Adding to 40211145225 its reverse (52254111204), we get a palindrome (92465256429).
The spelling of 40211145225 in words is "forty billion, two hundred eleven million, one hundred forty-five thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •