Base | Representation |
---|---|
bin | 1011110011010011011… |
… | …01000000000111000001 |
3 | 1102202200000102002212210 |
4 | 11321221231000013001 |
5 | 23120431041033213 |
6 | 510141223212333 |
7 | 41203450636542 |
oct | 5715155000701 |
9 | 1382600362783 |
10 | 405500330433 |
11 | 146a76402030 |
12 | 667092a70a9 |
13 | 2c314039533 |
14 | 158aa8a44c9 |
15 | a8347310c3 |
hex | 5e69b401c1 |
405500330433 has 8 divisors (see below), whose sum is σ = 589818662496. Its totient is φ = 245757776000.
The previous prime is 405500330383. The next prime is 405500330441. The reversal of 405500330433 is 334033005504.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 405500330433 - 28 = 405500330177 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 405500330433.
It is not an unprimeable number, because it can be changed into a prime (405500330453) 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 7 ways as a sum of consecutive naturals, for example, 6143944368 + ... + 6143944433.
It is an arithmetic number, because the mean of its divisors is an integer number (73727332812).
Almost surely, 2405500330433 is an apocalyptic number.
It is an amenable number.
405500330433 is a deficient number, since it is larger than the sum of its proper divisors (184318332063).
405500330433 is a wasteful number, since it uses less digits than its factorization.
405500330433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12287888815.
The product of its (nonzero) digits is 32400, while the sum is 30.
Adding to 405500330433 its reverse (334033005504), we get a palindrome (739533335937).
The spelling of 405500330433 in words is "four hundred five billion, five hundred million, three hundred thirty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •