Base | Representation |
---|---|
bin | 1011110110100100011110… |
… | …0010100111010000111001 |
3 | 1201010212012121201002011012 |
4 | 2331221013202213100321 |
5 | 3202004301021011441 |
6 | 43414513420043305 |
7 | 2513353233022025 |
oct | 275510742472071 |
9 | 51125177632135 |
10 | 13032131032121 |
11 | 41749942477a3 |
12 | 156586a393535 |
13 | 736c036b5066 |
14 | 330a894b7385 |
15 | 178ee04079eb |
hex | bda478a7439 |
13032131032121 has 8 divisors (see below), whose sum is σ = 13278073884480. Its totient is φ = 12786190164592.
The previous prime is 13032131032091. The next prime is 13032131032159. The reversal of 13032131032121 is 12123013123031.
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 13032131032121 - 214 = 13032131015737 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13032131052121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25113146 + ... + 25626828.
It is an arithmetic number, because the mean of its divisors is an integer number (1659759235560).
Almost surely, 213032131032121 is an apocalyptic number.
It is an amenable number.
13032131032121 is a deficient number, since it is larger than the sum of its proper divisors (245942852359).
13032131032121 is an equidigital number, since it uses as much as digits as its factorization.
13032131032121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 992415.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 13032131032121 its reverse (12123013123031), we get a palindrome (25155144155152).
The spelling of 13032131032121 in words is "thirteen trillion, thirty-two billion, one hundred thirty-one million, thirty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •