Base | Representation |
---|---|
bin | 1011110000100000110… |
… | …10001101101111111111 |
3 | 1102121210121110220000101 |
4 | 11320100122031233333 |
5 | 23104344032431333 |
6 | 505332425541531 |
7 | 41121360215542 |
oct | 5702032155777 |
9 | 1377717426011 |
10 | 404002233343 |
11 | 146377801565 |
12 | 6636b6448a7 |
13 | 2c135862457 |
14 | 157a7938859 |
15 | a797e6067d |
hex | 5e1068dbff |
404002233343 has 4 divisors (see below), whose sum is σ = 406259229240. Its totient is φ = 401745237448.
The previous prime is 404002233289. The next prime is 404002233347. The reversal of 404002233343 is 343332200404.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-404002233343 is a prime.
It is a super-2 number, since 2×4040022333432 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (404002233347) 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, 1128497680 + ... + 1128498037.
It is an arithmetic number, because the mean of its divisors is an integer number (101564807310).
Almost surely, 2404002233343 is an apocalyptic number.
404002233343 is a deficient number, since it is larger than the sum of its proper divisors (2256995897).
404002233343 is a wasteful number, since it uses less digits than its factorization.
404002233343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2256995896.
The product of its (nonzero) digits is 20736, while the sum is 28.
Adding to 404002233343 its reverse (343332200404), we get a palindrome (747334433747).
The spelling of 404002233343 in words is "four hundred four billion, two million, two hundred thirty-three thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •