Base | Representation |
---|---|
bin | 1011101100111111101… |
… | …11101011100111011011 |
3 | 1102102221000200102111102 |
4 | 11312133313223213123 |
5 | 23042012204214233 |
6 | 504421221222015 |
7 | 41023522505312 |
oct | 5663767534733 |
9 | 1372830612442 |
10 | 402114132443 |
11 | 145598a433a1 |
12 | 65b2326190b |
13 | 2bbc463699a |
14 | 15668c8b279 |
15 | a6d73031e8 |
hex | 5d9fdeb9db |
402114132443 has 4 divisors (see below), whose sum is σ = 415980137040. Its totient is φ = 388248127848.
The previous prime is 402114132439. The next prime is 402114132451. The reversal of 402114132443 is 344231411204.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 402114132443 - 22 = 402114132439 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29), and also a Moran number because the ratio is a prime number: 13866004567 = 402114132443 / (4 + 0 + 2 + 1 + 1 + 4 + 1 + 3 + 2 + 4 + 4 + 3).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (402114132403) 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, 6933002255 + ... + 6933002312.
It is an arithmetic number, because the mean of its divisors is an integer number (103995034260).
Almost surely, 2402114132443 is an apocalyptic number.
402114132443 is a deficient number, since it is larger than the sum of its proper divisors (13866004597).
402114132443 is a wasteful number, since it uses less digits than its factorization.
402114132443 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13866004596.
The product of its (nonzero) digits is 9216, while the sum is 29.
Adding to 402114132443 its reverse (344231411204), we get a palindrome (746345543647).
The spelling of 402114132443 in words is "four hundred two billion, one hundred fourteen million, one hundred thirty-two thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •