Base | Representation |
---|---|
bin | 11000011010100010… |
… | …110111001101111001 |
3 | 2111122222102121212102 |
4 | 120122202313031321 |
5 | 412142034303312 |
6 | 20013145353145 |
7 | 1615431050036 |
oct | 303242671571 |
9 | 74588377772 |
10 | 26215150457 |
11 | 10132850601 |
12 | 50b74987b5 |
13 | 261a203962 |
14 | 13a98dc38d |
15 | a36701ec2 |
hex | 61a8b7379 |
26215150457 has 2 divisors, whose sum is σ = 26215150458. Its totient is φ = 26215150456.
The previous prime is 26215150453. The next prime is 26215150463. The reversal of 26215150457 is 75405151262.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13918336576 + 12296813881 = 117976^2 + 110891^2 .
It is a cyclic number.
It is not a de Polignac number, because 26215150457 - 22 = 26215150453 is a prime.
It is a super-2 number, since 2×262151504572 (a number of 22 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 26215150457.
It is not a weakly prime, because it can be changed into another prime (26215150453) 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, 13107575228 + 13107575229.
It is an arithmetic number, because the mean of its divisors is an integer number (13107575229).
Almost surely, 226215150457 is an apocalyptic number.
It is an amenable number.
26215150457 is a deficient number, since it is larger than the sum of its proper divisors (1).
26215150457 is an equidigital number, since it uses as much as digits as its factorization.
26215150457 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 84000, while the sum is 38.
The spelling of 26215150457 in words is "twenty-six billion, two hundred fifteen million, one hundred fifty thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •