Base | Representation |
---|---|
bin | 1011110110000011010100… |
… | …0100000100100010111001 |
3 | 1201010000020100220201222211 |
4 | 2331200311010010202321 |
5 | 3201333034130213423 |
6 | 43410442331415121 |
7 | 2512616543611222 |
oct | 275406504044271 |
9 | 51100210821884 |
10 | 13023231101113 |
11 | 4171137494912 |
12 | 1563ba58b44a1 |
13 | 7361158a0aac |
14 | 3304834b0249 |
15 | 178b6dde610d |
hex | bd8351048b9 |
13023231101113 has 8 divisors (see below), whose sum is σ = 13375256932800. Its totient is φ = 12671207722800.
The previous prime is 13023231101107. The next prime is 13023231101137. The reversal of 13023231101113 is 31110113232031.
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 13023231101113 - 29 = 13023231100601 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13023231101513) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16554138 + ... + 17322988.
It is an arithmetic number, because the mean of its divisors is an integer number (1671907116600).
Almost surely, 213023231101113 is an apocalyptic number.
It is an amenable number.
13023231101113 is a deficient number, since it is larger than the sum of its proper divisors (352025831687).
13023231101113 is an equidigital number, since it uses as much as digits as its factorization.
13023231101113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1226687.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 13023231101113 its reverse (31110113232031), we get a palindrome (44133344333144).
The spelling of 13023231101113 in words is "thirteen trillion, twenty-three billion, two hundred thirty-one million, one hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •