Base | Representation |
---|---|
bin | 11000011011001100… |
… | …01110001100101011 |
3 | 1020211212110201001120 |
4 | 30031212032030223 |
5 | 203323413302243 |
6 | 10005105350323 |
7 | 642644606346 |
oct | 141546161453 |
9 | 36755421046 |
10 | 13113025323 |
11 | 5619a63012 |
12 | 265b6383a3 |
13 | 130c9260a8 |
14 | 8c578b45d |
15 | 51b32ac83 |
hex | 30d98e32b |
13113025323 has 8 divisors (see below), whose sum is σ = 18086931600. Its totient is φ = 8440567968.
The previous prime is 13113025291. The next prime is 13113025337. The reversal of 13113025323 is 32352031131.
13113025323 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 not a de Polignac number, because 13113025323 - 25 = 13113025291 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13113025293 and 13113025302.
It is not an unprimeable number, because it can be changed into a prime (13113025423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 75362128 + ... + 75362301.
It is an arithmetic number, because the mean of its divisors is an integer number (2260866450).
Almost surely, 213113025323 is an apocalyptic number.
13113025323 is a deficient number, since it is larger than the sum of its proper divisors (4973906277).
13113025323 is a wasteful number, since it uses less digits than its factorization.
13113025323 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150724461.
The product of its (nonzero) digits is 1620, while the sum is 24.
Adding to 13113025323 its reverse (32352031131), we get a palindrome (45465056454).
The spelling of 13113025323 in words is "thirteen billion, one hundred thirteen million, twenty-five thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •