Base | Representation |
---|---|
bin | 1010000001110000001010… |
… | …0100101101000011110101 |
3 | 1110001000000211111002000110 |
4 | 2200130002210231003311 |
5 | 2421114124400200023 |
6 | 35240530150133233 |
7 | 2215355222436045 |
oct | 240340244550365 |
9 | 43030024432013 |
10 | 11025224225013 |
11 | 3570853714569 |
12 | 12a0919351219 |
13 | 61c89c24709b |
14 | 2a18a3609725 |
15 | 141bd0dbda93 |
hex | a070292d0f5 |
11025224225013 has 4 divisors (see below), whose sum is σ = 14700298966688. Its totient is φ = 7350149483340.
The previous prime is 11025224224951. The next prime is 11025224225063. The reversal of 11025224225013 is 31052242252011.
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 not a de Polignac number, because 11025224225013 - 29 = 11025224224501 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 (11025224225063) 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, 1837537370833 + ... + 1837537370838.
It is an arithmetic number, because the mean of its divisors is an integer number (3675074741672).
Almost surely, 211025224225013 is an apocalyptic number.
It is an amenable number.
11025224225013 is a deficient number, since it is larger than the sum of its proper divisors (3675074741675).
11025224225013 is an equidigital number, since it uses as much as digits as its factorization.
11025224225013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3675074741674.
The product of its (nonzero) digits is 9600, while the sum is 30.
Adding to 11025224225013 its reverse (31052242252011), we get a palindrome (42077466477024).
The spelling of 11025224225013 in words is "eleven trillion, twenty-five billion, two hundred twenty-four million, two hundred twenty-five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.408 sec. • engine limits •