Base | Representation |
---|---|
bin | 1001101011000000010001… |
… | …0100010110000000001001 |
3 | 1101122122021102022221102112 |
4 | 2122300010110112000021 |
5 | 2343213233313414021 |
6 | 34341214200312105 |
7 | 2145211426005305 |
oct | 232600424260011 |
9 | 41578242287375 |
10 | 10634411466761 |
11 | 3430035041945 |
12 | 123902aa72635 |
13 | 5c1a890c7184 |
14 | 28a9cb67cd05 |
15 | 13695ad3ad5b |
hex | 9ac04516009 |
10634411466761 has 4 divisors (see below), whose sum is σ = 10634547969024. Its totient is φ = 10634274964500.
The previous prime is 10634411466743. The next prime is 10634411466803. The reversal of 10634411466761 is 16766411443601.
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 10634411466761 - 26 = 10634411466697 is a prime.
It is a super-2 number, since 2×106344114667612 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10634411466461) 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, 68134205 + ... + 68290106.
It is an arithmetic number, because the mean of its divisors is an integer number (2658636992256).
Almost surely, 210634411466761 is an apocalyptic number.
It is an amenable number.
10634411466761 is a deficient number, since it is larger than the sum of its proper divisors (136502263).
10634411466761 is an equidigital number, since it uses as much as digits as its factorization.
10634411466761 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 136502262.
The product of its (nonzero) digits is 1741824, while the sum is 50.
The spelling of 10634411466761 in words is "ten trillion, six hundred thirty-four billion, four hundred eleven million, four hundred sixty-six thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •