Base | Representation |
---|---|
bin | 101101011110100001111001… |
… | …0010111110100011000110101 |
3 | 1221110100112220100222222021112 |
4 | 1122331003302113310120311 |
5 | 404412412221421113141 |
6 | 3534434414321524405 |
7 | 150154333662406136 |
oct | 13275036227643065 |
9 | 1843315810888245 |
10 | 400020140410421 |
11 | 106505652838093 |
12 | 38a466bb7a3705 |
13 | 1422897804777b |
14 | 70ad11443dc8d |
15 | 313a6963827eb |
hex | 16bd0f25f4635 |
400020140410421 has 16 divisors (see below), whose sum is σ = 411789059539200. Its totient is φ = 388393558885440.
The previous prime is 400020140410417. The next prime is 400020140410463. The reversal of 400020140410421 is 124014041020004.
It is a cyclic number.
It is not a de Polignac number, because 400020140410421 - 22 = 400020140410417 is a prime.
It is a super-2 number, since 2×4000201404104212 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (400020140410411) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 30253775 + ... + 41416556.
It is an arithmetic number, because the mean of its divisors is an integer number (25736816221200).
Almost surely, 2400020140410421 is an apocalyptic number.
It is an amenable number.
400020140410421 is a deficient number, since it is larger than the sum of its proper divisors (11768919128779).
400020140410421 is a wasteful number, since it uses less digits than its factorization.
400020140410421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71671324.
The product of its (nonzero) digits is 1024, while the sum is 23.
Adding to 400020140410421 its reverse (124014041020004), we get a palindrome (524034181430425).
The spelling of 400020140410421 in words is "four hundred trillion, twenty billion, one hundred forty million, four hundred ten thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •