Base | Representation |
---|---|
bin | 11110101111010111011… |
… | …010100011001000101001 |
3 | 21110221120210012021000210 |
4 | 132233113122203020221 |
5 | 234102240402102213 |
6 | 4254235400451333 |
7 | 305422210156350 |
oct | 36572732431051 |
9 | 7427523167023 |
10 | 2112443003433 |
11 | 7449780055a4 |
12 | 2a14a4a79b49 |
13 | 124282c25829 |
14 | 743582c8997 |
15 | 39e397e30c3 |
hex | 1ebd76a3229 |
2112443003433 has 16 divisors (see below), whose sum is σ = 3388379755520. Its totient is φ = 1143578167056.
The previous prime is 2112443003371. The next prime is 2112443003441. The reversal of 2112443003433 is 3343003442112.
It is a happy number.
It is not a de Polignac number, because 2112443003433 - 26 = 2112443003369 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2112443003433.
It is not an unprimeable number, because it can be changed into a prime (2112443002433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2647171285 + ... + 2647172082.
It is an arithmetic number, because the mean of its divisors is an integer number (211773734720).
Almost surely, 22112443003433 is an apocalyptic number.
It is an amenable number.
2112443003433 is a deficient number, since it is larger than the sum of its proper divisors (1275936752087).
2112443003433 is a wasteful number, since it uses less digits than its factorization.
2112443003433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5294343396.
The product of its (nonzero) digits is 20736, while the sum is 30.
Adding to 2112443003433 its reverse (3343003442112), we get a palindrome (5455446445545).
The spelling of 2112443003433 in words is "two trillion, one hundred twelve billion, four hundred forty-three million, three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •