Base | Representation |
---|---|
bin | 10100111011001110… |
… | …00111011001010101 |
3 | 1001222221011001220012 |
4 | 22131213013121111 |
5 | 141001424231123 |
6 | 5054432050005 |
7 | 545252135645 |
oct | 123547073125 |
9 | 31887131805 |
10 | 11234211413 |
11 | 4845468347 |
12 | 2216393905 |
13 | 10a05cc799 |
14 | 78803a525 |
15 | 45b405378 |
hex | 29d9c7655 |
11234211413 has 4 divisors (see below), whose sum is σ = 11260156908. Its totient is φ = 11208265920.
The previous prime is 11234211383. The next prime is 11234211419. The reversal of 11234211413 is 31411243211.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 430272049 + 10803939364 = 20743^2 + 103942^2 .
It is a cyclic number.
It is not a de Polignac number, because 11234211413 - 216 = 11234145877 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11234211419) 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 3 ways as a sum of consecutive naturals, for example, 12972098 + ... + 12972963.
It is an arithmetic number, because the mean of its divisors is an integer number (2815039227).
Almost surely, 211234211413 is an apocalyptic number.
It is an amenable number.
11234211413 is a deficient number, since it is larger than the sum of its proper divisors (25945495).
11234211413 is an equidigital number, since it uses as much as digits as its factorization.
11234211413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25945494.
The product of its digits is 576, while the sum is 23.
Adding to 11234211413 its reverse (31411243211), we get a palindrome (42645454624).
The spelling of 11234211413 in words is "eleven billion, two hundred thirty-four million, two hundred eleven thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •