Base | Representation |
---|---|
bin | 101101011110011111000011… |
… | …0111101010100000110010101 |
3 | 1221110022222011110021100102202 |
4 | 1122330332012331110012111 |
5 | 404412312230043124023 |
6 | 3534431525320214245 |
7 | 150154026616200224 |
oct | 13274760675240625 |
9 | 1843288143240382 |
10 | 400014043333013 |
11 | 10650300413163a |
12 | 38a4549990a385 |
13 | 14228215b1c565 |
14 | 70acad67a0cbb |
15 | 313a43ae71128 |
hex | 16bcf86f54195 |
400014043333013 has 16 divisors (see below), whose sum is σ = 410419471365120. Its totient is φ = 389639710108800.
The previous prime is 400014043332947. The next prime is 400014043333019. The reversal of 400014043333013 is 310333340410004.
It is a cyclic number.
It is not a de Polignac number, because 400014043333013 - 210 = 400014043331989 is a prime.
It is a super-2 number, since 2×4000140433330132 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (400014043333019) 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, 167150456 + ... + 169526702.
It is an arithmetic number, because the mean of its divisors is an integer number (25651216960320).
Almost surely, 2400014043333013 is an apocalyptic number.
It is an amenable number.
400014043333013 is a deficient number, since it is larger than the sum of its proper divisors (10405428032107).
400014043333013 is a wasteful number, since it uses less digits than its factorization.
400014043333013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2382788.
The product of its (nonzero) digits is 15552, while the sum is 29.
Adding to 400014043333013 its reverse (310333340410004), we get a palindrome (710347383743017).
The spelling of 400014043333013 in words is "four hundred trillion, fourteen billion, forty-three million, three hundred thirty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •