Base | Representation |
---|---|
bin | 100101010111101001… |
… | …001011111110111101 |
3 | 10211120101111022111001 |
4 | 211113221023332331 |
5 | 1124134012323240 |
6 | 30233324330301 |
7 | 2620223616304 |
oct | 452751137675 |
9 | 124511438431 |
10 | 40125120445 |
11 | 16020647973 |
12 | 79399a3991 |
13 | 3a25c80027 |
14 | 1d2905b43b |
15 | 109c99e89a |
hex | 957a4bfbd |
40125120445 has 8 divisors (see below), whose sum is σ = 48159787320. Its totient is φ = 32093667840.
The previous prime is 40125120421. The next prime is 40125120457. The reversal of 40125120445 is 54402152104.
It can be written as a sum of positive squares in 4 ways, for example, as 103917636 + 40021202809 = 10194^2 + 200053^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 40125120445 - 231 = 37977636797 is a prime.
It is a super-2 number, since 2×401251204452 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 776016 + ... + 826105.
It is an arithmetic number, because the mean of its divisors is an integer number (6019973415).
Almost surely, 240125120445 is an apocalyptic number.
It is an amenable number.
40125120445 is a deficient number, since it is larger than the sum of its proper divisors (8034666875).
40125120445 is a wasteful number, since it uses less digits than its factorization.
40125120445 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1607135.
The product of its (nonzero) digits is 6400, while the sum is 28.
Adding to 40125120445 its reverse (54402152104), we get a palindrome (94527272549).
The spelling of 40125120445 in words is "forty billion, one hundred twenty-five million, one hundred twenty thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •