Base | Representation |
---|---|
bin | 100111001110010100010… |
… | …1010011001111100111101 |
3 | 201002100202201202102110001 |
4 | 1032130220222121330331 |
5 | 1201310443214131334 |
6 | 15244310230514301 |
7 | 1064322455213245 |
oct | 116345052317475 |
9 | 21070681672401 |
10 | 5390866161469 |
11 | 1799287454878 |
12 | 730952205991 |
13 | 3014832c1609 |
14 | 148cc2854b25 |
15 | 95367302714 |
hex | 4e728a99f3d |
5390866161469 has 2 divisors, whose sum is σ = 5390866161470. Its totient is φ = 5390866161468.
The previous prime is 5390866161409. The next prime is 5390866161493. The reversal of 5390866161469 is 9641616680935.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5387217397444 + 3648764025 = 2321038^2 + 60405^2 .
It is a cyclic number.
It is not a de Polignac number, because 5390866161469 - 229 = 5390329290557 is a prime.
It is a super-2 number, since 2×53908661614692 (a number of 26 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 5390866161469.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5390866161409) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2695433080734 + 2695433080735.
It is an arithmetic number, because the mean of its divisors is an integer number (2695433080735).
Almost surely, 25390866161469 is an apocalyptic number.
It is an amenable number.
5390866161469 is a deficient number, since it is larger than the sum of its proper divisors (1).
5390866161469 is an equidigital number, since it uses as much as digits as its factorization.
5390866161469 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 50388480, while the sum is 64.
The spelling of 5390866161469 in words is "five trillion, three hundred ninety billion, eight hundred sixty-six million, one hundred sixty-one thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •