Base | Representation |
---|---|
bin | 1011101001011101010… |
… | …00110001110011010101 |
3 | 1102021000122000000210110 |
4 | 11310232220301303111 |
5 | 23024114341301323 |
6 | 503504515313233 |
7 | 40625454162345 |
oct | 5645650616325 |
9 | 1367018000713 |
10 | 400214400213 |
11 | 144803660461 |
12 | 65692bab819 |
13 | 2b980b97c84 |
14 | 15528852d25 |
15 | a625649793 |
hex | 5d2ea31cd5 |
400214400213 has 8 divisors (see below), whose sum is σ = 533770509888. Its totient is φ = 266733945344.
The previous prime is 400214400193. The next prime is 400214400217. The reversal of 400214400213 is 312004412004.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 400214400213 - 26 = 400214400149 is a prime.
It is a super-2 number, since 2×4002144002132 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 400214400213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (400214400217) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18901356 + ... + 18922517.
It is an arithmetic number, because the mean of its divisors is an integer number (66721313736).
Almost surely, 2400214400213 is an apocalyptic number.
It is an amenable number.
400214400213 is a deficient number, since it is larger than the sum of its proper divisors (133556109675).
400214400213 is a wasteful number, since it uses less digits than its factorization.
400214400213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37827403.
The product of its (nonzero) digits is 768, while the sum is 21.
Adding to 400214400213 its reverse (312004412004), we get a palindrome (712218812217).
The spelling of 400214400213 in words is "four hundred billion, two hundred fourteen million, four hundred thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •