Base | Representation |
---|---|
bin | 10100111001110001… |
… | …11111101000110101 |
3 | 1001222002101210222121 |
4 | 22130320333220311 |
5 | 140440330333023 |
6 | 5053320555541 |
7 | 545044311655 |
oct | 123470775065 |
9 | 31862353877 |
10 | 11222121013 |
11 | 483965a684 |
12 | 2212322bb1 |
13 | 109ac585bc |
14 | 7865b0365 |
15 | 45a317d5d |
hex | 29ce3fa35 |
11222121013 has 4 divisors (see below), whose sum is σ = 11222982540. Its totient is φ = 11221259488.
The previous prime is 11222120989. The next prime is 11222121023. The reversal of 11222121013 is 31012122211.
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 7235713969 + 3986407044 = 85063^2 + 63138^2 .
It is a cyclic number.
It is not a de Polignac number, because 11222121013 - 29 = 11222120501 is a prime.
It is a super-2 number, since 2×112221210132 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11222121023) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 410920 + ... + 437377.
It is an arithmetic number, because the mean of its divisors is an integer number (2805745635).
Almost surely, 211222121013 is an apocalyptic number.
It is an amenable number.
11222121013 is a deficient number, since it is larger than the sum of its proper divisors (861527).
11222121013 is an equidigital number, since it uses as much as digits as its factorization.
11222121013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 861526.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 11222121013 its reverse (31012122211), we get a palindrome (42234243224).
The spelling of 11222121013 in words is "eleven billion, two hundred twenty-two million, one hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •