Base | Representation |
---|---|
bin | 1001101011000010000110… |
… | …1001111001000000000001 |
3 | 1101122200112201110122221101 |
4 | 2122300201221321000001 |
5 | 2343220240313420101 |
6 | 34341335101454401 |
7 | 2145226553353555 |
oct | 232604151710001 |
9 | 41580481418841 |
10 | 10634903654401 |
11 | 3430267952794 |
12 | 1239147871401 |
13 | 5c1b37075370 |
14 | 28aa36b9d865 |
15 | 13698915e401 |
hex | 9ac21a79001 |
10634903654401 has 32 divisors (see below), whose sum is σ = 12076792549920. Its totient is φ = 9295369574400.
The previous prime is 10634903654359. The next prime is 10634903654411. The reversal of 10634903654401 is 10445630943601.
It is a Cunningham number, because it is equal to 32611202+1.
It can be written as a sum of positive squares in 16 ways, for example, as 1363700786176 + 9271202868225 = 1167776^2 + 3044865^2 .
It is not a de Polignac number, because 10634903654401 - 231 = 10632756170753 is a prime.
It is a super-2 number, since 2×106349036544012 (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 (10634903654411) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 45459991 + ... + 45693331.
It is an arithmetic number, because the mean of its divisors is an integer number (377399767185).
Almost surely, 210634903654401 is an apocalyptic number.
It is an amenable number.
10634903654401 is a deficient number, since it is larger than the sum of its proper divisors (1441888895519).
10634903654401 is a wasteful number, since it uses less digits than its factorization.
10634903654401 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 235717.
The product of its (nonzero) digits is 933120, while the sum is 46.
The spelling of 10634903654401 in words is "ten trillion, six hundred thirty-four billion, nine hundred three million, six hundred fifty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.561 sec. • engine limits •