Base | Representation |
---|---|
bin | 1011101101000010111… |
… | …11110100010110101101 |
3 | 1102102222221001100100222 |
4 | 11312201133310112231 |
5 | 23042041201244323 |
6 | 504424034301125 |
7 | 41024303523464 |
oct | 5664137642655 |
9 | 1372887040328 |
10 | 402141431213 |
11 | 145602399365 |
12 | 65b304277a5 |
13 | 2bbca1a42c2 |
14 | 1566c7559db |
15 | a6d98e69c8 |
hex | 5da17f45ad |
402141431213 has 4 divisors (see below), whose sum is σ = 402329086848. Its totient is φ = 401953775580.
The previous prime is 402141431191. The next prime is 402141431221. The reversal of 402141431213 is 312134141204.
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 a de Polignac number, because none of the positive numbers 2k-402141431213 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (402141431243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 93824603 + ... + 93828888.
It is an arithmetic number, because the mean of its divisors is an integer number (100582271712).
Almost surely, 2402141431213 is an apocalyptic number.
It is an amenable number.
402141431213 is a deficient number, since it is larger than the sum of its proper divisors (187655635).
402141431213 is a wasteful number, since it uses less digits than its factorization.
402141431213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 187655634.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 402141431213 its reverse (312134141204), we get a palindrome (714275572417).
The spelling of 402141431213 in words is "four hundred two billion, one hundred forty-one million, four hundred thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •