Base | Representation |
---|---|
bin | 111100100101110… |
… | …1010010011101010 |
3 | 12020200122011220101 |
4 | 1321023222103222 |
5 | 13130433200020 |
6 | 533424220014 |
7 | 101245031164 |
oct | 17113522352 |
9 | 5220564811 |
10 | 2033100010 |
11 | 9536a5147 |
12 | 488a6a60a |
13 | 265296376 |
14 | 154033934 |
15 | bd75000a |
hex | 792ea4ea |
2033100010 has 8 divisors (see below), whose sum is σ = 3659580036. Its totient is φ = 813240000.
The previous prime is 2033100007. The next prime is 2033100037. The reversal of 2033100010 is 100013302.
It can be written as a sum of positive squares in 2 ways, for example, as 1856661921 + 176438089 = 43089^2 + 13283^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (10), and also a Moran number because the ratio is a prime number: 203310001 = 2033100010 / (2 + 0 + 3 + 3 + 1 + 0 + 0 + 0 + 1 + 0).
It is a self number, because there is not a number n which added to its sum of digits gives 2033100010.
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, 101654991 + ... + 101655010.
Almost surely, 22033100010 is an apocalyptic number.
2033100010 is a deficient number, since it is larger than the sum of its proper divisors (1626480026).
2033100010 is a wasteful number, since it uses less digits than its factorization.
2033100010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 203310008.
The product of its (nonzero) digits is 18, while the sum is 10.
The square root of 2033100010 is about 45089.9102904408. The cubic root of 2033100010 is about 1266.8336211913.
Adding to 2033100010 its reverse (100013302), we get a palindrome (2133113312).
The spelling of 2033100010 in words is "two billion, thirty-three million, one hundred thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •