Base | Representation |
---|---|
bin | 111011111000100… |
… | …1110100100011001 |
3 | 12012001000202121000 |
4 | 1313301032210121 |
5 | 13103401042213 |
6 | 531220135213 |
7 | 100536363615 |
oct | 16761164431 |
9 | 5161022530 |
10 | 2009393433 |
11 | 941283033 |
12 | 480b37509 |
13 | 2603b5ac8 |
14 | 150c22345 |
15 | bb61ac73 |
hex | 77c4e919 |
2009393433 has 16 divisors (see below), whose sum is σ = 3072908800. Its totient is φ = 1296382320.
The previous prime is 2009393429. The next prime is 2009393453. The reversal of 2009393433 is 3343939002.
It is not a de Polignac number, because 2009393433 - 22 = 2009393429 is a prime.
It is a super-3 number, since 3×20093934333 (a number of 29 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2009393423) 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 15 ways as a sum of consecutive naturals, for example, 1199518 + ... + 1201191.
It is an arithmetic number, because the mean of its divisors is an integer number (192056800).
Almost surely, 22009393433 is an apocalyptic number.
It is an amenable number.
2009393433 is a deficient number, since it is larger than the sum of its proper divisors (1063515367).
2009393433 is a wasteful number, since it uses less digits than its factorization.
2009393433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2400749 (or 2400743 counting only the distinct ones).
The product of its (nonzero) digits is 52488, while the sum is 36.
The square root of 2009393433 is about 44826.2582980110. The cubic root of 2009393433 is about 1261.8904671684.
It can be divided in two parts, 20093 and 93433, that added together give a triangular number (113526 = T476).
The spelling of 2009393433 in words is "two billion, nine million, three hundred ninety-three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •