Base | Representation |
---|---|
bin | 1010000100011111101001… |
… | …0010000001010011111001 |
3 | 1110012111121200211200000220 |
4 | 2201013322102001103321 |
5 | 2422402112403443003 |
6 | 35314320313050253 |
7 | 2221643440001316 |
oct | 241077222012371 |
9 | 43174550750026 |
10 | 11072329749753 |
11 | 35898265414a8 |
12 | 12a9a849b6989 |
13 | 62416842b94c |
14 | 2a3c91761d0d |
15 | 14303b5b6353 |
hex | a11fa4814f9 |
11072329749753 has 4 divisors (see below), whose sum is σ = 14763106333008. Its totient is φ = 7381553166500.
The previous prime is 11072329749751. The next prime is 11072329749791. The reversal of 11072329749753 is 35794792327011.
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 11072329749753 - 21 = 11072329749751 is a prime.
It is a super-2 number, since 2×110723297497532 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (11072329749751) 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, 1845388291623 + ... + 1845388291628.
It is an arithmetic number, because the mean of its divisors is an integer number (3690776583252).
Almost surely, 211072329749753 is an apocalyptic number.
It is an amenable number.
11072329749753 is a deficient number, since it is larger than the sum of its proper divisors (3690776583255).
11072329749753 is an equidigital number, since it uses as much as digits as its factorization.
11072329749753 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3690776583254.
The product of its (nonzero) digits is 20003760, while the sum is 60.
The spelling of 11072329749753 in words is "eleven trillion, seventy-two billion, three hundred twenty-nine million, seven hundred forty-nine thousand, seven hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •