Base | Representation |
---|---|
bin | 111111101010001… |
… | …1100110101000001 |
3 | 12111212101110121011 |
4 | 1333110130311001 |
5 | 13333313124033 |
6 | 551543200521 |
7 | 103635162505 |
oct | 17724346501 |
9 | 5455343534 |
10 | 2136067393 |
11 | 9a6833059 |
12 | 4b7446141 |
13 | 280708705 |
14 | 163998305 |
15 | c77ddccd |
hex | 7f51cd41 |
2136067393 has 4 divisors (see below), whose sum is σ = 2146801600. Its totient is φ = 2125333188.
The previous prime is 2136067379. The next prime is 2136067403. The reversal of 2136067393 is 3937606312.
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 2136067393 - 229 = 1599196481 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2136077393) 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, 5366805 + ... + 5367202.
It is an arithmetic number, because the mean of its divisors is an integer number (536700400).
Almost surely, 22136067393 is an apocalyptic number.
It is an amenable number.
2136067393 is a deficient number, since it is larger than the sum of its proper divisors (10734207).
2136067393 is a wasteful number, since it uses less digits than its factorization.
2136067393 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10734206.
The product of its (nonzero) digits is 122472, while the sum is 40.
The square root of 2136067393 is about 46217.6091224979. The cubic root of 2136067393 is about 1287.8688833728.
It can be divided in two parts, 213 and 6067393, that added together give a palindrome (6067606).
The spelling of 2136067393 in words is "two billion, one hundred thirty-six million, sixty-seven thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •