Base | Representation |
---|---|
bin | 101101011110100010010010… |
… | …1100111010110011011000101 |
3 | 1221110100122010021200202010020 |
4 | 1122331010211213112123011 |
5 | 404412421002012320010 |
6 | 3534435035512245353 |
7 | 150154364202000105 |
oct | 13275044547263305 |
9 | 1843318107622106 |
10 | 400021000120005 |
11 | 106505a54050680 |
12 | 38a468bb6a0859 |
13 | 14228a841a5374 |
14 | 70ad1966ad205 |
15 | 313a6e6aa1470 |
hex | 16bd1259d66c5 |
400021000120005 has 64 divisors (see below), whose sum is σ = 722839290163200. Its totient is φ = 187120539889920.
The previous prime is 400021000120003. The next prime is 400021000120043. The reversal of 400021000120005 is 500021000120004.
It is not a de Polignac number, because 400021000120005 - 21 = 400021000120003 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (400021000120003) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 25149535 + ... + 37848924.
It is an arithmetic number, because the mean of its divisors is an integer number (11294363908800).
Almost surely, 2400021000120005 is an apocalyptic number.
It is an amenable number.
400021000120005 is a deficient number, since it is larger than the sum of its proper divisors (322818290043195).
400021000120005 is a wasteful number, since it uses less digits than its factorization.
400021000120005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 62999834.
The product of its (nonzero) digits is 80, while the sum is 15.
Adding to 400021000120005 its reverse (500021000120004), we get a palindrome (900042000240009).
Subtracting 400021000120005 from its reverse (500021000120004), we obtain a palindrome (99999999999999).
The spelling of 400021000120005 in words is "four hundred trillion, twenty-one billion, one hundred twenty thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •