Base | Representation |
---|---|
bin | 1011101001001000111… |
… | …00110001001011011001 |
3 | 1102020120201101101000122 |
4 | 11310210130301023121 |
5 | 23023242112323034 |
6 | 503435532043025 |
7 | 40621310321123 |
oct | 5644434611331 |
9 | 1366521341018 |
10 | 400043479769 |
11 | 14472612a39a |
12 | 65645903475 |
13 | 2b954652a0b |
14 | 1550dc80213 |
15 | a61563662e |
hex | 5d247312d9 |
400043479769 has 2 divisors, whose sum is σ = 400043479770. Its totient is φ = 400043479768.
The previous prime is 400043479741. The next prime is 400043479807. The reversal of 400043479769 is 967974340004.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 394430473369 + 5613006400 = 628037^2 + 74920^2 .
It is a cyclic number.
It is not a de Polignac number, because 400043479769 - 28 = 400043479513 is a prime.
It is a super-2 number, since 2×4000434797692 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 400043479769.
It is not a weakly prime, because it can be changed into another prime (400043479469) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 200021739884 + 200021739885.
It is an arithmetic number, because the mean of its divisors is an integer number (200021739885).
Almost surely, 2400043479769 is an apocalyptic number.
It is an amenable number.
400043479769 is a deficient number, since it is larger than the sum of its proper divisors (1).
400043479769 is an equidigital number, since it uses as much as digits as its factorization.
400043479769 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4572288, while the sum is 53.
The spelling of 400043479769 in words is "four hundred billion, forty-three million, four hundred seventy-nine thousand, seven hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •