Base | Representation |
---|---|
bin | 111111010111101… |
… | …0101000011010011 |
3 | 12111012002001221000 |
4 | 1332233111003103 |
5 | 13323320224321 |
6 | 550554433043 |
7 | 103456362636 |
oct | 17657250323 |
9 | 5435061830 |
10 | 2126336211 |
11 | 9a129695a |
12 | 4b4132783 |
13 | 27b6ac30c |
14 | 162583c1d |
15 | c6a1a826 |
hex | 7ebd50d3 |
2126336211 has 16 divisors (see below), whose sum is σ = 3159488800. Its totient is φ = 1413345024.
The previous prime is 2126336161. The next prime is 2126336243. The reversal of 2126336211 is 1126336212.
2126336211 is a `hidden beast` number, since 2 + 1 + 2 + 6 + 33 + 621 + 1 = 666.
It is not a de Polignac number, because 2126336211 - 29 = 2126335699 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2126836211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 107746 + ... + 125943.
It is an arithmetic number, because the mean of its divisors is an integer number (197468050).
Almost surely, 22126336211 is an apocalyptic number.
2126336211 is a deficient number, since it is larger than the sum of its proper divisors (1033152589).
2126336211 is a wasteful number, since it uses less digits than its factorization.
2126336211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 234035 (or 234029 counting only the distinct ones).
The product of its digits is 2592, while the sum is 27.
The square root of 2126336211 is about 46112.2132520225. The cubic root of 2126336211 is about 1285.9102113960.
Subtracting from 2126336211 its reverse (1126336212), we obtain a palindrome (999999999).
The spelling of 2126336211 in words is "two billion, one hundred twenty-six million, three hundred thirty-six thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •