Base | Representation |
---|---|
bin | 10100100111100010… |
… | …00100110110100001 |
3 | 1001120102101000101221 |
4 | 22103301010312201 |
5 | 140132134102043 |
6 | 5030212055041 |
7 | 541205242411 |
oct | 122361046641 |
9 | 31512330357 |
10 | 11069050273 |
11 | 4770210336 |
12 | 218b004481 |
13 | 1075322ab8 |
14 | 770126641 |
15 | 44bb7d8ed |
hex | 293c44da1 |
11069050273 has 4 divisors (see below), whose sum is σ = 11071754800. Its totient is φ = 11066345748.
The previous prime is 11069050271. The next prime is 11069050283. The reversal of 11069050273 is 37205096011.
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, and also an emirpimes, since its reverse is a distinct semiprime: 37205096011 = 3299 ⋅11277689.
It is a cyclic number.
It is not a de Polignac number, because 11069050273 - 21 = 11069050271 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11069050271) 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, 1346115 + ... + 1354312.
It is an arithmetic number, because the mean of its divisors is an integer number (2767938700).
Almost surely, 211069050273 is an apocalyptic number.
It is an amenable number.
11069050273 is a deficient number, since it is larger than the sum of its proper divisors (2704527).
11069050273 is an equidigital number, since it uses as much as digits as its factorization.
11069050273 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2704526.
The product of its (nonzero) digits is 11340, while the sum is 34.
The spelling of 11069050273 in words is "eleven billion, sixty-nine million, fifty thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •