Base | Representation |
---|---|
bin | 1001011101011001101001… |
… | …1111011111001010000001 |
3 | 1100211022001012121000022102 |
4 | 2113112122133133022001 |
5 | 2330401122142101321 |
6 | 34042004051120145 |
7 | 2122266143234546 |
oct | 227263237371201 |
9 | 40738035530272 |
10 | 10400707768961 |
11 | 334aa08431744 |
12 | 11bb887ba3055 |
13 | 5a5a232c6163 |
14 | 27d57b2ccbcd |
15 | 13082da45c0b |
hex | 9759a7df281 |
10400707768961 has 4 divisors (see below), whose sum is σ = 10852912454592. Its totient is φ = 9948503083332.
The previous prime is 10400707768921. The next prime is 10400707768981. The reversal of 10400707768961 is 16986770700401.
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 10400707768961 - 214 = 10400707752577 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10400707768897 and 10400707768906.
It is not an unprimeable number, because it can be changed into a prime (10400707768921) 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, 226102342781 + ... + 226102342826.
It is an arithmetic number, because the mean of its divisors is an integer number (2713228113648).
Almost surely, 210400707768961 is an apocalyptic number.
It is an amenable number.
10400707768961 is a deficient number, since it is larger than the sum of its proper divisors (452204685631).
10400707768961 is an equidigital number, since it uses as much as digits as its factorization.
10400707768961 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 452204685630.
The product of its (nonzero) digits is 3556224, while the sum is 56.
The spelling of 10400707768961 in words is "ten trillion, four hundred billion, seven hundred seven million, seven hundred sixty-eight thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •