Base | Representation |
---|---|
bin | 1101101001101110010… |
… | …00001110011000100011 |
3 | 1122211202201212221002112 |
4 | 12310313020032120203 |
5 | 30141132020310321 |
6 | 555253553505535 |
7 | 45614102042105 |
oct | 6646710163043 |
9 | 1584681787075 |
10 | 469076338211 |
11 | 170a30400718 |
12 | 76ab08722ab |
13 | 353065c6250 |
14 | 189bc25d575 |
15 | c305da6a5b |
hex | 6d3720e623 |
469076338211 has 8 divisors (see below), whose sum is σ = 521454589824. Its totient is φ = 419026008960.
The previous prime is 469076338169. The next prime is 469076338231. The reversal of 469076338211 is 112833670964.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-469076338211 is a prime.
It is a super-2 number, since 2×4690763382112 (a number of 24 digits) contains 22 as substring.
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 469076338211.
It is not an unprimeable number, because it can be changed into a prime (469076338231) 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 in 7 ways as a sum of consecutive naturals, for example, 581980166 + ... + 581980971.
It is an arithmetic number, because the mean of its divisors is an integer number (65181823728).
Almost surely, 2469076338211 is an apocalyptic number.
469076338211 is a deficient number, since it is larger than the sum of its proper divisors (52378251613).
469076338211 is a wasteful number, since it uses less digits than its factorization.
469076338211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1163961181.
The product of its (nonzero) digits is 1306368, while the sum is 50.
The spelling of 469076338211 in words is "four hundred sixty-nine billion, seventy-six million, three hundred thirty-eight thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •