Base | Representation |
---|---|
bin | 111111001011110… |
… | …0010101001010001 |
3 | 12110202100021001021 |
4 | 1332113202221101 |
5 | 13320221203213 |
6 | 550213035441 |
7 | 103352361553 |
oct | 17627425121 |
9 | 5422307037 |
10 | 2120100433 |
11 | 998817920 |
12 | 4b2025b81 |
13 | 27a307bc9 |
14 | 1617dd4d3 |
15 | c61d7d8d |
hex | 7e5e2a51 |
2120100433 has 4 divisors (see below), whose sum is σ = 2312836848. Its totient is φ = 1927364020.
The previous prime is 2120100431. The next prime is 2120100491. The reversal of 2120100433 is 3340010212.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2120100433 - 21 = 2120100431 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2120100431) 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 3 ways as a sum of consecutive naturals, for example, 96368191 + ... + 96368212.
It is an arithmetic number, because the mean of its divisors is an integer number (578209212).
Almost surely, 22120100433 is an apocalyptic number.
It is an amenable number.
2120100433 is a deficient number, since it is larger than the sum of its proper divisors (192736415).
2120100433 is a wasteful number, since it uses less digits than its factorization.
2120100433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 192736414.
The product of its (nonzero) digits is 144, while the sum is 16.
The square root of 2120100433 is about 46044.5483526552. The cubic root of 2120100433 is about 1284.6519434631.
Adding to 2120100433 its reverse (3340010212), we get a palindrome (5460110645).
The spelling of 2120100433 in words is "two billion, one hundred twenty million, one hundred thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •