Base | Representation |
---|---|
bin | 100101010111101000… |
… | …111000101101000101 |
3 | 10211120101100022011022 |
4 | 211113220320231011 |
5 | 1124134002311402 |
6 | 30233322520525 |
7 | 2620223140133 |
oct | 452750705505 |
9 | 124511308138 |
10 | 40125041477 |
11 | 160205a3604 |
12 | 7939966145 |
13 | 3a25c530c1 |
14 | 1d2903a753 |
15 | 109c9862a2 |
hex | 957a38b45 |
40125041477 has 2 divisors, whose sum is σ = 40125041478. Its totient is φ = 40125041476.
The previous prime is 40125041413. The next prime is 40125041479. The reversal of 40125041477 is 77414052104.
40125041477 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 24797115841 + 15327925636 = 157471^2 + 123806^2 .
It is a cyclic number.
It is not a de Polignac number, because 40125041477 - 26 = 40125041413 is a prime.
It is a super-2 number, since 2×401250414772 (a number of 22 digits) contains 22 as substring.
Together with 40125041479, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (40125041479) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 20062520738 + 20062520739.
It is an arithmetic number, because the mean of its divisors is an integer number (20062520739).
Almost surely, 240125041477 is an apocalyptic number.
It is an amenable number.
40125041477 is a deficient number, since it is larger than the sum of its proper divisors (1).
40125041477 is an equidigital number, since it uses as much as digits as its factorization.
40125041477 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 31360, while the sum is 35.
The spelling of 40125041477 in words is "forty billion, one hundred twenty-five million, forty-one thousand, four hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •