Base | Representation |
---|---|
bin | 1001101010100111111… |
… | …01100100010011011001 |
3 | 1011202021002111111202001 |
4 | 10311103331210103121 |
5 | 20420141002131301 |
6 | 412324020241001 |
7 | 32665162012300 |
oct | 4652375442331 |
9 | 1152232444661 |
10 | 332121130201 |
11 | 1189407a08a3 |
12 | 5444a840161 |
13 | 2541b79c523 |
14 | 12109177437 |
15 | 898c625c01 |
hex | 4d53f644d9 |
332121130201 has 6 divisors (see below), whose sum is σ = 386344988250. Its totient is φ = 284675254416.
The previous prime is 332121130189. The next prime is 332121130223. The reversal of 332121130201 is 102031121233.
It can be written as a sum of positive squares in only one way, i.e., 327189720025 + 4931410176 = 572005^2 + 70224^2 .
It is not a de Polignac number, because 332121130201 - 215 = 332121097433 is a prime.
It is a super-2 number, since 2×3321211302012 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (332121136201) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 3388991076 + ... + 3388991173.
It is an arithmetic number, because the mean of its divisors is an integer number (64390831375).
Almost surely, 2332121130201 is an apocalyptic number.
It is an amenable number.
332121130201 is a deficient number, since it is larger than the sum of its proper divisors (54223858049).
332121130201 is an equidigital number, since it uses as much as digits as its factorization.
332121130201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6777982263 (or 6777982256 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 332121130201 its reverse (102031121233), we get a palindrome (434152251434).
The spelling of 332121130201 in words is "three hundred thirty-two billion, one hundred twenty-one million, one hundred thirty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •