Base | Representation |
---|---|
bin | 1011101101001010100… |
… | …10000011101000100001 |
3 | 1102110011100112112221201 |
4 | 11312211102003220201 |
5 | 23042203430321031 |
6 | 504434223321201 |
7 | 41026004343031 |
oct | 5664522035041 |
9 | 1373140475851 |
10 | 402204932641 |
11 | 145635220986 |
12 | 65b49750201 |
13 | 2bc0a3a8c05 |
14 | 15676d658c1 |
15 | a6e028bd61 |
hex | 5da5483a21 |
402204932641 has 4 divisors (see below), whose sum is σ = 407296134400. Its totient is φ = 397113730884.
The previous prime is 402204932627. The next prime is 402204932651. The reversal of 402204932641 is 146239402204.
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 402204932641 - 235 = 367845194273 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 402204932641.
It is not an unprimeable number, because it can be changed into a prime (402204932651) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2545600761 + ... + 2545600918.
It is an arithmetic number, because the mean of its divisors is an integer number (101824033600).
Almost surely, 2402204932641 is an apocalyptic number.
It is an amenable number.
402204932641 is a deficient number, since it is larger than the sum of its proper divisors (5091201759).
402204932641 is an equidigital number, since it uses as much as digits as its factorization.
402204932641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5091201758.
The product of its (nonzero) digits is 82944, while the sum is 37.
The spelling of 402204932641 in words is "four hundred two billion, two hundred four million, nine hundred thirty-two thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •