Base | Representation |
---|---|
bin | 1001101110101000010111… |
… | …1111010001000110110000 |
3 | 1101212121002120021200101110 |
4 | 2123222011333101012300 |
5 | 2400223333412200104 |
6 | 34430000450033320 |
7 | 2152545415150350 |
oct | 233520577210660 |
9 | 41777076250343 |
10 | 10696716521904 |
11 | 34544a7682a56 |
12 | 1249118878840 |
13 | 5c79082793ca |
14 | 28da1c318b60 |
15 | 1383a5b0ce89 |
hex | 9ba85fd11b0 |
10696716521904 has 80 divisors (see below), whose sum is σ = 32252713694208. Its totient is φ = 2991179083776.
The previous prime is 10696716521903. The next prime is 10696716521971. The reversal of 10696716521904 is 40912561769601.
It is a happy number.
10696716521904 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×106967165219042 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10696716521903) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 338659377 + ... + 338690960.
Almost surely, 210696716521904 is an apocalyptic number.
10696716521904 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
10696716521904 is an abundant number, since it is smaller than the sum of its proper divisors (21555997172304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10696716521904 is a wasteful number, since it uses less digits than its factorization.
10696716521904 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 677350402 (or 677350396 counting only the distinct ones).
The product of its (nonzero) digits is 4898880, while the sum is 57.
The spelling of 10696716521904 in words is "ten trillion, six hundred ninety-six billion, seven hundred sixteen million, five hundred twenty-one thousand, nine hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •