Base | Representation |
---|---|
bin | 10100111000110100… |
… | …01001000110111101 |
3 | 1001221112011220210012 |
4 | 22130122021012331 |
5 | 140431243031331 |
6 | 5052431353005 |
7 | 544615465520 |
oct | 123432110675 |
9 | 31845156705 |
10 | 11214033341 |
11 | 4835036255 |
12 | 220b682765 |
13 | 10993862b4 |
14 | 7854a6bb7 |
15 | 45976b82b |
hex | 29c6891bd |
11214033341 has 16 divisors (see below), whose sum is σ = 13804658688. Its totient is φ = 8897526000.
The previous prime is 11214033317. The next prime is 11214033359. The reversal of 11214033341 is 14333041211.
11214033341 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 11214033341 - 210 = 11214032317 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11214033641) 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 15 ways as a sum of consecutive naturals, for example, 1118435 + ... + 1128416.
It is an arithmetic number, because the mean of its divisors is an integer number (862791168).
Almost surely, 211214033341 is an apocalyptic number.
It is an amenable number.
11214033341 is a deficient number, since it is larger than the sum of its proper divisors (2590625347).
11214033341 is a wasteful number, since it uses less digits than its factorization.
11214033341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2246912.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 11214033341 its reverse (14333041211), we get a palindrome (25547074552).
The spelling of 11214033341 in words is "eleven billion, two hundred fourteen million, thirty-three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.226 sec. • engine limits •