Base | Representation |
---|---|
bin | 10100100000110001… |
… | …01000110000111001 |
3 | 1001102110121102021220 |
4 | 22100120220300321 |
5 | 140023122441441 |
6 | 5020424022253 |
7 | 536616052146 |
oct | 122030506071 |
9 | 31373542256 |
10 | 11012312121 |
11 | 47411880a8 |
12 | 2174001989 |
13 | 1066648725 |
14 | 7667973cd |
15 | 446bc2466 |
hex | 290628c39 |
11012312121 has 4 divisors (see below), whose sum is σ = 14683082832. Its totient is φ = 7341541412.
The previous prime is 11012312041. The next prime is 11012312123. The reversal of 11012312121 is 12121321011.
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 11012312121 - 222 = 11008117817 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 11012312121.
It is not an unprimeable number, because it can be changed into a prime (11012312123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1835385351 + ... + 1835385356.
It is an arithmetic number, because the mean of its divisors is an integer number (3670770708).
Almost surely, 211012312121 is an apocalyptic number.
It is an amenable number.
11012312121 is a deficient number, since it is larger than the sum of its proper divisors (3670770711).
11012312121 is an equidigital number, since it uses as much as digits as its factorization.
11012312121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3670770710.
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 11012312121 its reverse (12121321011), we get a palindrome (23133633132).
The spelling of 11012312121 in words is "eleven billion, twelve million, three hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.112 sec. • engine limits •