Base | Representation |
---|---|
bin | 1011110110100001011111… |
… | …1011010110010101011011 |
3 | 1201010210010221120201020010 |
4 | 2331220113323112111123 |
5 | 3202001132021210021 |
6 | 43414302242333003 |
7 | 2513324363112423 |
oct | 275502773262533 |
9 | 51123127521203 |
10 | 13031332210011 |
11 | 4174614340935 |
12 | 156568695a163 |
13 | 736b0705535b |
14 | 330a11377483 |
15 | 178e95214976 |
hex | bda17ed655b |
13031332210011 has 4 divisors (see below), whose sum is σ = 17375109613352. Its totient is φ = 8687554806672.
The previous prime is 13031332209989. The next prime is 13031332210031. The reversal of 13031332210011 is 11001223313031.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 13031332210011 - 25 = 13031332209979 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13031332210011.
It is not an unprimeable number, because it can be changed into a prime (13031332210031) 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, 2171888701666 + ... + 2171888701671.
It is an arithmetic number, because the mean of its divisors is an integer number (4343777403338).
Almost surely, 213031332210011 is an apocalyptic number.
13031332210011 is a deficient number, since it is larger than the sum of its proper divisors (4343777403341).
13031332210011 is an equidigital number, since it uses as much as digits as its factorization.
13031332210011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4343777403340.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 13031332210011 its reverse (11001223313031), we get a palindrome (24032555523042).
The spelling of 13031332210011 in words is "thirteen trillion, thirty-one billion, three hundred thirty-two million, two hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •