Base | Representation |
---|---|
bin | 1110100110110100001011… |
… | …11110010000101001010001 |
3 | 11012201122100221102022100211 |
4 | 13103122011332100221101 |
5 | 13202223241330132241 |
6 | 152151421430044121 |
7 | 6523410603564424 |
oct | 723320576205121 |
9 | 135648327368324 |
10 | 32120013130321 |
11 | a264026054a66 |
12 | 37290a74a9641 |
13 | 14bcb9a8072ac |
14 | 7d088cbdd9bb |
15 | 3aa7adea2781 |
hex | 1d3685f90a51 |
32120013130321 has 8 divisors (see below), whose sum is σ = 33810653020320. Its totient is φ = 30429384528672.
The previous prime is 32120013130279. The next prime is 32120013130367. The reversal of 32120013130321 is 12303131002123.
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 32120013130321 - 213 = 32120013122129 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 32120013130292 and 32120013130301.
It is not an unprimeable number, because it can be changed into a prime (32120013130721) 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, 3366501 + ... + 8693293.
It is an arithmetic number, because the mean of its divisors is an integer number (4226331627540).
Almost surely, 232120013130321 is an apocalyptic number.
It is an amenable number.
32120013130321 is a deficient number, since it is larger than the sum of its proper divisors (1690639889999).
32120013130321 is a wasteful number, since it uses less digits than its factorization.
32120013130321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5644175.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 32120013130321 its reverse (12303131002123), we get a palindrome (44423144132444).
The spelling of 32120013130321 in words is "thirty-two trillion, one hundred twenty billion, thirteen million, one hundred thirty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •