Base | Representation |
---|---|
bin | 101101011111111011011110… |
… | …1110000000111000101001011 |
3 | 1221111000221111102001100212020 |
4 | 1122333312331300013011023 |
5 | 404424040230431124230 |
6 | 3535103033150215523 |
7 | 150204254415406323 |
oct | 13277667560070513 |
9 | 1844027442040766 |
10 | 400212531114315 |
11 | 10657a1aa327517 |
12 | 38a77a52ab45a3 |
13 | 14240b58a5ba6a |
14 | 70b8565abc283 |
15 | 31406a6785810 |
hex | 16bfdbdc0714b |
400212531114315 has 8 divisors (see below), whose sum is σ = 640340049782928. Its totient is φ = 213446683260960.
The previous prime is 400212531114229. The next prime is 400212531114317. The reversal of 400212531114315 is 513411135212004.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 400212531114315 - 211 = 400212531112267 is a prime.
It is not an unprimeable number, because it can be changed into a prime (400212531114317) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13340417703796 + ... + 13340417703825.
It is an arithmetic number, because the mean of its divisors is an integer number (80042506222866).
Almost surely, 2400212531114315 is an apocalyptic number.
400212531114315 is a deficient number, since it is larger than the sum of its proper divisors (240127518668613).
400212531114315 is a wasteful number, since it uses less digits than its factorization.
400212531114315 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26680835407629.
The product of its (nonzero) digits is 14400, while the sum is 33.
Adding to 400212531114315 its reverse (513411135212004), we get a palindrome (913623666326319).
The spelling of 400212531114315 in words is "four hundred trillion, two hundred twelve billion, five hundred thirty-one million, one hundred fourteen thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •