Base | Representation |
---|---|
bin | 1011111100010101101001… |
… | …1011101100011010101101 |
3 | 1201111100000011002200222111 |
4 | 2333011122123230122231 |
5 | 3210120230422430013 |
6 | 43532223234444021 |
7 | 2523462114233230 |
oct | 277053233543255 |
9 | 51440004080874 |
10 | 13131232233133 |
11 | 4202a192a0913 |
12 | 1580b07133611 |
13 | 743367c2b981 |
14 | 3357ab011417 |
15 | 17b8907a173d |
hex | bf15a6ec6ad |
13131232233133 has 16 divisors (see below), whose sum is σ = 15668834284800. Its totient is φ = 10759634873856.
The previous prime is 13131232233127. The next prime is 13131232233241. The reversal of 13131232233133 is 33133223213131.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 13131232233133 - 25 = 13131232233101 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13131232233095 and 13131232233104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13131232233733) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 23757558 + ... + 24303991.
It is an arithmetic number, because the mean of its divisors is an integer number (979302142800).
Almost surely, 213131232233133 is an apocalyptic number.
It is an amenable number.
13131232233133 is a deficient number, since it is larger than the sum of its proper divisors (2537602051667).
13131232233133 is a wasteful number, since it uses less digits than its factorization.
13131232233133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48063276.
The product of its digits is 17496, while the sum is 31.
Adding to 13131232233133 its reverse (33133223213131), we get a palindrome (46264455446264).
The spelling of 13131232233133 in words is "thirteen trillion, one hundred thirty-one billion, two hundred thirty-two million, two hundred thirty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •