Base | Representation |
---|---|
bin | 100111101001001111000… |
… | …0101011110110101010101 |
3 | 201021212222020022201011102 |
4 | 1033102132011132311111 |
5 | 1203232334204042334 |
6 | 15331030152115445 |
7 | 1101440066240255 |
oct | 117223605366525 |
9 | 21255866281142 |
10 | 5448670768469 |
11 | 181084a669655 |
12 | 73bba4995b85 |
13 | 306a65c71096 |
14 | 14ba07909965 |
15 | 96aebe4867e |
hex | 4f49e15ed55 |
5448670768469 has 2 divisors, whose sum is σ = 5448670768470. Its totient is φ = 5448670768468.
The previous prime is 5448670768397. The next prime is 5448670768481. The reversal of 5448670768469 is 9648670768445.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3335828280625 + 2112842487844 = 1826425^2 + 1453562^2 .
It is a cyclic number.
It is not a de Polignac number, because 5448670768469 - 236 = 5379951291733 is a prime.
It is a super-2 number, since 2×54486707684692 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5448670768396 and 5448670768405.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5448670768969) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2724335384234 + 2724335384235.
It is an arithmetic number, because the mean of its divisors is an integer number (2724335384235).
Almost surely, 25448670768469 is an apocalyptic number.
It is an amenable number.
5448670768469 is a deficient number, since it is larger than the sum of its proper divisors (1).
5448670768469 is an equidigital number, since it uses as much as digits as its factorization.
5448670768469 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1950842880, while the sum is 74.
The spelling of 5448670768469 in words is "five trillion, four hundred forty-eight billion, six hundred seventy million, seven hundred sixty-eight thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •