Base | Representation |
---|---|
bin | 1110100100000011111111… |
… | …11110100010101000101001 |
3 | 11012101121012210220001002212 |
4 | 13102001333332202220221 |
5 | 13144201031323311301 |
6 | 152040135404534505 |
7 | 6513521562135350 |
oct | 722017776425051 |
9 | 135347183801085 |
10 | 32025423260201 |
11 | a2279a6590588 |
12 | 37128a9551435 |
13 | 14b3ca4b03747 |
14 | 7ca0784c0997 |
15 | 3a80c4bd44bb |
hex | 1d207ffa2a29 |
32025423260201 has 4 divisors (see below), whose sum is σ = 36600483725952. Its totient is φ = 27450362794452.
The previous prime is 32025423260191. The next prime is 32025423260221. The reversal of 32025423260201 is 10206232452023.
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 a de Polignac number, because none of the positive numbers 2k-32025423260201 is a prime.
It is a super-5 number, since 5×320254232602015 (a number of 69 digits) contains 55555 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (32025423260221) 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, 2287530232865 + ... + 2287530232878.
It is an arithmetic number, because the mean of its divisors is an integer number (9150120931488).
Almost surely, 232025423260201 is an apocalyptic number.
It is an amenable number.
32025423260201 is a deficient number, since it is larger than the sum of its proper divisors (4575060465751).
32025423260201 is an equidigital number, since it uses as much as digits as its factorization.
32025423260201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4575060465750.
The product of its (nonzero) digits is 34560, while the sum is 32.
The spelling of 32025423260201 in words is "thirty-two trillion, twenty-five billion, four hundred twenty-three million, two hundred sixty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •