Base | Representation |
---|---|
bin | 11000010000110110… |
… | …11111110111001011 |
3 | 1020121211100000201000 |
4 | 30020123133313023 |
5 | 203134214444021 |
6 | 5552331230043 |
7 | 640542650454 |
oct | 141033376713 |
9 | 36554300630 |
10 | 13026328011 |
11 | 5585028044 |
12 | 26365a8323 |
13 | 12c798c4c8 |
14 | 8b806012b |
15 | 513902b26 |
hex | 3086dfdcb |
13026328011 has 8 divisors (see below), whose sum is σ = 19298263760. Its totient is φ = 8684218656.
The previous prime is 13026327991. The next prime is 13026328037. The reversal of 13026328011 is 11082362031.
It is a happy number.
13026328011 is a `hidden beast` number, since 13 + 0 + 2 + 632 + 8 + 0 + 11 = 666.
It is not a de Polignac number, because 13026328011 - 27 = 13026327883 is a prime.
It is a super-2 number, since 2×130263280112 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 482456593 = 13026328011 / (1 + 3 + 0 + 2 + 6 + 3 + 2 + 8 + 0 + 1 + 1).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13026328111) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 241228270 + ... + 241228323.
It is an arithmetic number, because the mean of its divisors is an integer number (2412282970).
Almost surely, 213026328011 is an apocalyptic number.
13026328011 is a deficient number, since it is larger than the sum of its proper divisors (6271935749).
13026328011 is an equidigital number, since it uses as much as digits as its factorization.
13026328011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 482456602 (or 482456596 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 27.
The spelling of 13026328011 in words is "thirteen billion, twenty-six million, three hundred twenty-eight thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •