Base | Representation |
---|---|
bin | 1100000001010001… |
… | …0100011110001001 |
3 | 22022212022211112101 |
4 | 3000110110132021 |
5 | 23101444132301 |
6 | 1252100113401 |
7 | 142646145505 |
oct | 30024243611 |
9 | 8285284471 |
10 | 3226552201 |
11 | 1406339474 |
12 | 760695861 |
13 | 3c56073b2 |
14 | 22873b305 |
15 | 13d3e5701 |
hex | c0514789 |
3226552201 has 4 divisors (see below), whose sum is σ = 3227965312. Its totient is φ = 3225139092.
The previous prime is 3226552193. The next prime is 3226552271. The reversal of 3226552201 is 1022556223.
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, and also an emirpimes, since its reverse is a distinct semiprime: 1022556223 = 13 ⋅78658171.
It is a cyclic number.
It is not a de Polignac number, because 3226552201 - 23 = 3226552193 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3226552201.
It is not an unprimeable number, because it can be changed into a prime (3226552271) 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, 703125 + ... + 707698.
It is an arithmetic number, because the mean of its divisors is an integer number (806991328).
Almost surely, 23226552201 is an apocalyptic number.
It is an amenable number.
3226552201 is a deficient number, since it is larger than the sum of its proper divisors (1413111).
3226552201 is a wasteful number, since it uses less digits than its factorization.
3226552201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1413110.
The product of its (nonzero) digits is 7200, while the sum is 28.
The square root of 3226552201 is about 56802.7481817561. The cubic root of 3226552201 is about 1477.6771757758.
The spelling of 3226552201 in words is "three billion, two hundred twenty-six million, five hundred fifty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •