Base | Representation |
---|---|
bin | 1100000010001001111011… |
… | …0010001101011011011011 |
3 | 1201211212221111220112020011 |
4 | 3000202132302031123123 |
5 | 3213234410241442021 |
6 | 44050151254542351 |
7 | 2533630362564142 |
oct | 300423662153333 |
9 | 51755844815204 |
10 | 13231163234011 |
11 | 4241339789948 |
12 | 15983559679b7 |
13 | 74c902360318 |
14 | 33a56ac30759 |
15 | 17e28d90bde1 |
hex | c089ec8d6db |
13231163234011 has 4 divisors (see below), whose sum is σ = 13231839313224. Its totient is φ = 13230487154800.
The previous prime is 13231163233993. The next prime is 13231163234017. The reversal of 13231163234011 is 11043236113231.
13231163234011 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 13231163234011 - 221 = 13231161136859 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13231163234017) 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, 338010250 + ... + 338049391.
It is an arithmetic number, because the mean of its divisors is an integer number (3307959828306).
Almost surely, 213231163234011 is an apocalyptic number.
13231163234011 is a deficient number, since it is larger than the sum of its proper divisors (676079213).
13231163234011 is an equidigital number, since it uses as much as digits as its factorization.
13231163234011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 676079212.
The product of its (nonzero) digits is 7776, while the sum is 31.
Adding to 13231163234011 its reverse (11043236113231), we get a palindrome (24274399347242).
The spelling of 13231163234011 in words is "thirteen trillion, two hundred thirty-one billion, one hundred sixty-three million, two hundred thirty-four thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •