Base | Representation |
---|---|
bin | 111100100101110… |
… | …1111001110000100 |
3 | 12020200200012111122 |
4 | 1321023233032010 |
5 | 13130434321012 |
6 | 533424453112 |
7 | 101245143641 |
oct | 17113571604 |
9 | 5220605448 |
10 | 2033120132 |
11 | 95370927a |
12 | 488a7a198 |
13 | 2652a2584 |
14 | 15403adc8 |
15 | bd755e72 |
hex | 792ef384 |
2033120132 has 12 divisors (see below), whose sum is σ = 3560712540. Its totient is φ = 1015773696.
The previous prime is 2033120129. The next prime is 2033120147. The reversal of 2033120132 is 2310213302.
It can be written as a sum of positive squares in 2 ways, for example, as 1491813376 + 541306756 = 38624^2 + 23266^2 .
It is a super-2 number, since 2×20331201322 = 8267154942287394848, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2033120132.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 190757 + ... + 201132.
It is an arithmetic number, because the mean of its divisors is an integer number (296726045).
Almost surely, 22033120132 is an apocalyptic number.
It is an amenable number.
2033120132 is a deficient number, since it is larger than the sum of its proper divisors (1527592408).
2033120132 is a wasteful number, since it uses less digits than its factorization.
2033120132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 393190 (or 393188 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 17.
The square root of 2033120132 is about 45090.1334218474. The cubic root of 2033120132 is about 1266.8378005466.
Adding to 2033120132 its reverse (2310213302), we get a palindrome (4343333434).
The spelling of 2033120132 in words is "two billion, thirty-three million, one hundred twenty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •