Base | Representation |
---|---|
bin | 1011110110100101000110… |
… | …1111010001000101110011 |
3 | 1201010212122112122022102121 |
4 | 2331221101233101011303 |
5 | 3202010123320340311 |
6 | 43414542411055111 |
7 | 2513360411165263 |
oct | 275512157210563 |
9 | 51125575568377 |
10 | 13032302121331 |
11 | 4174a71883639 |
12 | 15658b7741497 |
13 | 736c2cc8908c |
14 | 330aa40d17a3 |
15 | 179000450b71 |
hex | bda51bd1173 |
13032302121331 has 16 divisors (see below), whose sum is σ = 13254562189440. Its totient is φ = 12810322644480.
The previous prime is 13032302121301. The next prime is 13032302121341. The reversal of 13032302121331 is 13312120323031.
It is a cyclic number.
It is not a de Polignac number, because 13032302121331 - 239 = 12482546307443 is a prime.
It is a super-2 number, since 2×130323021213312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13032302121296 and 13032302121305.
It is not an unprimeable number, because it can be changed into a prime (13032302121301) 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, 1057038375 + ... + 1057050703.
It is an arithmetic number, because the mean of its divisors is an integer number (828410136840).
Almost surely, 213032302121331 is an apocalyptic number.
13032302121331 is a deficient number, since it is larger than the sum of its proper divisors (222260068109).
13032302121331 is a wasteful number, since it uses less digits than its factorization.
13032302121331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22254.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 13032302121331 its reverse (13312120323031), we get a palindrome (26344422444362).
The spelling of 13032302121331 in words is "thirteen trillion, thirty-two billion, three hundred two million, one hundred twenty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •