Base | Representation |
---|---|
bin | 1110100110110100101111… |
… | …10111010100110010111001 |
3 | 11012201200010212020121202212 |
4 | 13103122113313110302321 |
5 | 13202224400201132301 |
6 | 152151511311504505 |
7 | 6523421210161205 |
oct | 723322767246271 |
9 | 135650125217685 |
10 | 32120313302201 |
11 | a26416a5365a3 |
12 | 372916bb28135 |
13 | 14bcc17a653a7 |
14 | 7d08baa19b05 |
15 | 3aa7ca4e74bb |
hex | 1d3697dd4cb9 |
32120313302201 has 4 divisors (see below), whose sum is σ = 33810856107600. Its totient is φ = 30429770496804.
The previous prime is 32120313302197. The next prime is 32120313302227. The reversal of 32120313302201 is 10220331302123.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 32120313302201 - 22 = 32120313302197 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (32120313302281) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 845271402671 + ... + 845271402708.
It is an arithmetic number, because the mean of its divisors is an integer number (8452714026900).
Almost surely, 232120313302201 is an apocalyptic number.
It is an amenable number.
32120313302201 is a deficient number, since it is larger than the sum of its proper divisors (1690542805399).
32120313302201 is a wasteful number, since it uses less digits than its factorization.
32120313302201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1690542805398.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 32120313302201 its reverse (10220331302123), we get a palindrome (42340644604324).
The spelling of 32120313302201 in words is "thirty-two trillion, one hundred twenty billion, three hundred thirteen million, three hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •