Base | Representation |
---|---|
bin | 101100001000101100111… |
… | …001101100000100100001 |
3 | 101201221201000000201022100 |
4 | 230020230321230010201 |
5 | 344143041024344301 |
6 | 10241201401001013 |
7 | 432061400410503 |
oct | 54105471540441 |
9 | 11657630021270 |
10 | 3033000231201 |
11 | a6a319618926 |
12 | 40b995783169 |
13 | 19001a65a825 |
14 | a6b259a7d73 |
15 | 53d6695a286 |
hex | 2c22ce6c121 |
3033000231201 has 12 divisors (see below), whose sum is σ = 4532069311380. Its totient is φ = 1952276010720.
The previous prime is 3033000231193. The next prime is 3033000231281. The reversal of 3033000231201 is 1021320003303.
It can be written as a sum of positive squares in 2 ways, for example, as 1034166963600 + 1998833267601 = 1016940^2 + 1413801^2 .
It is not a de Polignac number, because 3033000231201 - 23 = 3033000231193 is a prime.
It is not an unprimeable number, because it can be changed into a prime (3033000231281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5810345010 + ... + 5810345531.
It is an arithmetic number, because the mean of its divisors is an integer number (377672442615).
Almost surely, 23033000231201 is an apocalyptic number.
It is an amenable number.
3033000231201 is a deficient number, since it is larger than the sum of its proper divisors (1499069080179).
3033000231201 is a wasteful number, since it uses less digits than its factorization.
3033000231201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11620690576 (or 11620690573 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 18.
Adding to 3033000231201 its reverse (1021320003303), we get a palindrome (4054320234504).
The spelling of 3033000231201 in words is "three trillion, thirty-three billion, two hundred thirty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •