Base | Representation |
---|---|
bin | 1011110101111100001000… |
… | …0001110000000101111011 |
3 | 1201002211020212022012022102 |
4 | 2331133002001300011323 |
5 | 3201320111041110321 |
6 | 43405523025214015 |
7 | 2512520660153306 |
oct | 275370201600573 |
9 | 51084225265272 |
10 | 13021301113211 |
11 | 4170337017396 |
12 | 156374749130b |
13 | 735b98a9a911 |
14 | 33033d03bb3d |
15 | 178aa9762c0b |
hex | bd7c207017b |
13021301113211 has 4 divisors (see below), whose sum is σ = 13108692396000. Its totient is φ = 12933909830424.
The previous prime is 13021301113201. The next prime is 13021301113217. The reversal of 13021301113211 is 11231110312031.
13021301113211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13021301113211 - 26 = 13021301113147 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13021301113217) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 43695641171 + ... + 43695641468.
It is an arithmetic number, because the mean of its divisors is an integer number (3277173099000).
Almost surely, 213021301113211 is an apocalyptic number.
13021301113211 is a deficient number, since it is larger than the sum of its proper divisors (87391282789).
13021301113211 is an equidigital number, since it uses as much as digits as its factorization.
13021301113211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 87391282788.
The product of its (nonzero) digits is 108, while the sum is 20.
Adding to 13021301113211 its reverse (11231110312031), we get a palindrome (24252411425242).
The spelling of 13021301113211 in words is "thirteen trillion, twenty-one billion, three hundred one million, one hundred thirteen thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.137 sec. • engine limits •