Base | Representation |
---|---|
bin | 101101100001100001101111… |
… | …1100101101100010001011111 |
3 | 1221111210221100110221101212012 |
4 | 1123003003133211230101133 |
5 | 404441140011341444021 |
6 | 3535351553032501435 |
7 | 150226160526340655 |
oct | 13303033745542137 |
9 | 1844727313841765 |
10 | 400432142140511 |
11 | 106654354aa2988 |
12 | 38ab252224a87b |
13 | 14258786ca4c40 |
14 | 70c503a550dd5 |
15 | 314625b73e35b |
hex | 16c30df96c45f |
400432142140511 has 16 divisors (see below), whose sum is σ = 431512970325024. Its totient is φ = 369391088029824.
The previous prime is 400432142140441. The next prime is 400432142140519. The reversal of 400432142140511 is 115041241234004.
It is a cyclic number.
It is not a de Polignac number, because 400432142140511 - 226 = 400432075031647 is a prime.
It is a super-2 number, since 2×4004321421405112 (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 (400432142140519) 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, 1291449080 + ... + 1291759106.
It is an arithmetic number, because the mean of its divisors is an integer number (26969560645314).
Almost surely, 2400432142140511 is an apocalyptic number.
400432142140511 is a deficient number, since it is larger than the sum of its proper divisors (31080828184513).
400432142140511 is a wasteful number, since it uses less digits than its factorization.
400432142140511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 373850.
The product of its (nonzero) digits is 15360, while the sum is 32.
Adding to 400432142140511 its reverse (115041241234004), we get a palindrome (515473383374515).
The spelling of 400432142140511 in words is "four hundred trillion, four hundred thirty-two billion, one hundred forty-two million, one hundred forty thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •