Base | Representation |
---|---|
bin | 1011110110100100011110… |
… | …0011101101110111101011 |
3 | 1201010212012122020202212101 |
4 | 2331221013203231313223 |
5 | 3202004301104240243 |
6 | 43414513430154231 |
7 | 2513353235335132 |
oct | 275510743556753 |
9 | 51125178222771 |
10 | 13032131321323 |
11 | 4174994425004 |
12 | 156586a4b2977 |
13 | 736c0378689a |
14 | 330a89550919 |
15 | 178ee046354d |
hex | bda478eddeb |
13032131321323 has 8 divisors (see below), whose sum is σ = 13050306414000. Its totient is φ = 13013963215968.
The previous prime is 13032131321267. The next prime is 13032131321353. The reversal of 13032131321323 is 32312313123031.
It is a happy number.
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 13032131321323 - 217 = 13032131190251 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13032131321291 and 13032131321300.
It is not an unprimeable number, because it can be changed into a prime (13032131321353) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1991565 + ... + 5480017.
It is an arithmetic number, because the mean of its divisors is an integer number (1631288301750).
Almost surely, 213032131321323 is an apocalyptic number.
13032131321323 is a deficient number, since it is larger than the sum of its proper divisors (18175092677).
13032131321323 is an equidigital number, since it uses as much as digits as its factorization.
13032131321323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3493661.
The product of its (nonzero) digits is 5832, while the sum is 28.
Adding to 13032131321323 its reverse (32312313123031), we get a palindrome (45344444444354).
The spelling of 13032131321323 in words is "thirteen trillion, thirty-two billion, one hundred thirty-one million, three hundred twenty-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •