Base | Representation |
---|---|
bin | 111010001101011011000… |
… | …110101001100101001101 |
3 | 112011102001211210222210120 |
4 | 322031123012221211031 |
5 | 1011014243103204123 |
6 | 12301350151255153 |
7 | 562000162452066 |
oct | 72153306514515 |
9 | 15142054728716 |
10 | 4000143022413 |
11 | 13024a64a850a |
12 | 54730797a4b9 |
13 | 23029a623695 |
14 | db87232d56d |
15 | 6e0bd80c2e3 |
hex | 3a35b1a994d |
4000143022413 has 4 divisors (see below), whose sum is σ = 5333524029888. Its totient is φ = 2666762014940.
The previous prime is 4000143022411. The next prime is 4000143022441. The reversal of 4000143022413 is 3142203410004.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 4000143022413 - 21 = 4000143022411 is a prime.
It is a super-2 number, since 2×40001430224132 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4000143022411) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 666690503733 + ... + 666690503738.
It is an arithmetic number, because the mean of its divisors is an integer number (1333381007472).
Almost surely, 24000143022413 is an apocalyptic number.
It is an amenable number.
4000143022413 is a deficient number, since it is larger than the sum of its proper divisors (1333381007475).
4000143022413 is a wasteful number, since it uses less digits than its factorization.
4000143022413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1333381007474.
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 4000143022413 its reverse (3142203410004), we get a palindrome (7142346432417).
The spelling of 4000143022413 in words is "four trillion, one hundred forty-three million, twenty-two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •