Base | Representation |
---|---|
bin | 10011111100001000… |
… | …10011010000011101 |
3 | 1000122001022220022211 |
4 | 21332010103100131 |
5 | 133410434210021 |
6 | 4530125040421 |
7 | 526164632026 |
oct | 117604232035 |
9 | 30561286284 |
10 | 10704991261 |
11 | 45a3763418 |
12 | 20a90b6111 |
13 | 1017a86673 |
14 | 737a39c4d |
15 | 429c193e1 |
hex | 27e11341d |
10704991261 has 4 divisors (see below), whose sum is σ = 10803202300. Its totient is φ = 10606780224.
The previous prime is 10704991201. The next prime is 10704991277. The reversal of 10704991261 is 16219940701.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 16219940701 = 53 ⋅306036617.
It can be written as a sum of positive squares in 2 ways, for example, as 9000127161 + 1704864100 = 94869^2 + 41290^2 .
It is a cyclic number.
It is not a de Polignac number, because 10704991261 - 217 = 10704860189 is a prime.
It is a super-2 number, since 2×107049912612 (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 (10704991201) 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, 49105356 + ... + 49105573.
It is an arithmetic number, because the mean of its divisors is an integer number (2700800575).
Almost surely, 210704991261 is an apocalyptic number.
It is an amenable number.
10704991261 is a deficient number, since it is larger than the sum of its proper divisors (98211039).
10704991261 is an equidigital number, since it uses as much as digits as its factorization.
10704991261 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 98211038.
The product of its (nonzero) digits is 27216, while the sum is 40.
The spelling of 10704991261 in words is "ten billion, seven hundred four million, nine hundred ninety-one thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •