Base | Representation |
---|---|
bin | 1100000000111011001010… |
… | …1111000101000110011111 |
3 | 1201202212101020001112101010 |
4 | 3000032302233011012133 |
5 | 3212413111404340221 |
6 | 44032333440550303 |
7 | 2532251454566412 |
oct | 300166257050637 |
9 | 51685336045333 |
10 | 13210023121311 |
11 | 4233380738325 |
12 | 1594236022393 |
13 | 74a9136cbab3 |
14 | 339523367b79 |
15 | 17d952a34c76 |
hex | c03b2bc519f |
13210023121311 has 8 divisors (see below), whose sum is σ = 17614140274224. Its totient is φ = 8806294024640.
The previous prime is 13210023121277. The next prime is 13210023121313. The reversal of 13210023121311 is 11312132001231.
13210023121311 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13210023121311 - 241 = 11010999865759 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13210023121313) 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, 96934620 + ... + 97070801.
It is an arithmetic number, because the mean of its divisors is an integer number (2201767534278).
Almost surely, 213210023121311 is an apocalyptic number.
13210023121311 is a deficient number, since it is larger than the sum of its proper divisors (4404117152913).
13210023121311 is a wasteful number, since it uses less digits than its factorization.
13210023121311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 194028121.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 13210023121311 its reverse (11312132001231), we get a palindrome (24522155122542).
The spelling of 13210023121311 in words is "thirteen trillion, two hundred ten billion, twenty-three million, one hundred twenty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •