Base | Representation |
---|---|
bin | 101101011110101011001001… |
… | …0001010100001110001001001 |
3 | 1221110102110011111111002011211 |
4 | 1122331112102022201301021 |
5 | 404413223410243300100 |
6 | 3534451501154253121 |
7 | 150155636104043065 |
oct | 13275262212416111 |
9 | 1843373144432154 |
10 | 400040001150025 |
11 | 10651301469a775 |
12 | 38a4a522b871a1 |
13 | 1422a7c19138b2 |
14 | 70b007a034aa5 |
15 | 313ae59c911ba |
hex | 16bd5922a1c49 |
400040001150025 has 12 divisors (see below), whose sum is σ = 496998071043472. Its totient is φ = 319420085037840.
The previous prime is 400040001150019. The next prime is 400040001150059. The reversal of 400040001150025 is 520051100040004.
It is not a de Polignac number, because 400040001150025 - 23 = 400040001150017 is a prime.
It is a super-2 number, since 2×4000400011500252 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 400040001149978 and 400040001150005.
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 11 ways as a sum of consecutive naturals, for example, 15297883719 + ... + 15297909868.
Almost surely, 2400040001150025 is an apocalyptic number.
It is an amenable number.
400040001150025 is a deficient number, since it is larger than the sum of its proper divisors (96958069893447).
400040001150025 is a wasteful number, since it uses less digits than its factorization.
400040001150025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30595794120 (or 30595794115 counting only the distinct ones).
The product of its (nonzero) digits is 800, while the sum is 22.
Adding to 400040001150025 its reverse (520051100040004), we get a palindrome (920091101190029).
The spelling of 400040001150025 in words is "four hundred trillion, forty billion, one million, one hundred fifty thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •