Base | Representation |
---|---|
bin | 1100000001010000101000… |
… | …10110110101001100100011 |
3 | 10110120211111120121020222122 |
4 | 12000220110112311030203 |
5 | 11431023323442101323 |
6 | 132114255025454455 |
7 | 5365421644214426 |
oct | 600502426651443 |
9 | 113524446536878 |
10 | 26431570268963 |
11 | 8470625390162 |
12 | 2b6a7474a142b |
13 | 1199642770292 |
14 | 67541b00d9bd |
15 | 30c82c11aec8 |
hex | 180a145b5323 |
26431570268963 has 2 divisors, whose sum is σ = 26431570268964. Its totient is φ = 26431570268962.
The previous prime is 26431570268953. The next prime is 26431570269001. The reversal of 26431570268963 is 36986207513462.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 26431570268963 - 216 = 26431570203427 is a prime.
It is a super-2 number, since 2×264315702689632 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 26431570268896 and 26431570268905.
It is not a weakly prime, because it can be changed into another prime (26431570268953) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 13215785134481 + 13215785134482.
It is an arithmetic number, because the mean of its divisors is an integer number (13215785134482).
It is a 2-persistent number, because it is pandigital, and so is 2⋅26431570268963 = 52863140537926, but 3⋅26431570268963 = 79294710806889 is not.
Almost surely, 226431570268963 is an apocalyptic number.
26431570268963 is a deficient number, since it is larger than the sum of its proper divisors (1).
26431570268963 is an equidigital number, since it uses as much as digits as its factorization.
26431570268963 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 78382080, while the sum is 62.
The spelling of 26431570268963 in words is "twenty-six trillion, four hundred thirty-one billion, five hundred seventy million, two hundred sixty-eight thousand, nine hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •