Base | Representation |
---|---|
bin | 1011111011111000000111… |
… | …0001111001110110000101 |
3 | 1201110120112111210002000011 |
4 | 2332332001301321312011 |
5 | 3210003010410312013 |
6 | 43524432323350221 |
7 | 2523061445105665 |
oct | 276760161716605 |
9 | 51416474702004 |
10 | 13123302432133 |
11 | 41aa61a10aa73 |
12 | 157b473522371 |
13 | 7426a30c6b2a |
14 | 335257bbc1a5 |
15 | 17b579520c3d |
hex | bef81c79d85 |
13123302432133 has 16 divisors (see below), whose sum is σ = 14086826380800. Its totient is φ = 12189017378160.
The previous prime is 13123302432077. The next prime is 13123302432173. The reversal of 13123302432133 is 33123420332131.
It is a cyclic number.
It is not a de Polignac number, because 13123302432133 - 221 = 13123300334981 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13123302432095 and 13123302432104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13123302432173) 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, 26932191 + ... + 27415132.
It is an arithmetic number, because the mean of its divisors is an integer number (880426648800).
Almost surely, 213123302432133 is an apocalyptic number.
It is an amenable number.
13123302432133 is a deficient number, since it is larger than the sum of its proper divisors (963523948667).
13123302432133 is a wasteful number, since it uses less digits than its factorization.
13123302432133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54347592.
The product of its (nonzero) digits is 23328, while the sum is 31.
Adding to 13123302432133 its reverse (33123420332131), we get a palindrome (46246722764264).
The spelling of 13123302432133 in words is "thirteen trillion, one hundred twenty-three billion, three hundred two million, four hundred thirty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •