Base | Representation |
---|---|
bin | 11000101100000001… |
… | …10111000010100001 |
3 | 1021012201011110002021 |
4 | 30112000313002201 |
5 | 204121040213311 |
6 | 10031112021441 |
7 | 646311030355 |
oct | 142600670241 |
9 | 37181143067 |
10 | 13254226081 |
11 | 5691735258 |
12 | 269a991881 |
13 | 1332c63b35 |
14 | 8da425465 |
15 | 52891d171 |
hex | 3160370a1 |
13254226081 has 2 divisors, whose sum is σ = 13254226082. Its totient is φ = 13254226080.
The previous prime is 13254226079. The next prime is 13254226151. The reversal of 13254226081 is 18062245231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8540717056 + 4713509025 = 92416^2 + 68655^2 .
It is an emirp because it is prime and its reverse (18062245231) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13254226081 - 21 = 13254226079 is a prime.
It is a super-2 number, since 2×132542260812 (a number of 21 digits) contains 22 as substring.
Together with 13254226079, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (13254226021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6627113040 + 6627113041.
It is an arithmetic number, because the mean of its divisors is an integer number (6627113041).
Almost surely, 213254226081 is an apocalyptic number.
It is an amenable number.
13254226081 is a deficient number, since it is larger than the sum of its proper divisors (1).
13254226081 is an equidigital number, since it uses as much as digits as its factorization.
13254226081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23040, while the sum is 34.
The spelling of 13254226081 in words is "thirteen billion, two hundred fifty-four million, two hundred twenty-six thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •