Base | Representation |
---|---|
bin | 1001011010001011001010… |
… | …0010110101110111101100 |
3 | 1100121222222010022022101120 |
4 | 2112202302202311313230 |
5 | 2323444111320224024 |
6 | 34000315435340540 |
7 | 2115264413163540 |
oct | 226426242656754 |
9 | 40558863268346 |
10 | 10345276726764 |
11 | 3329453014271 |
12 | 11b0b982b1750 |
13 | 5a072b307ac5 |
14 | 27a9dd575a20 |
15 | 12e1874a3479 |
hex | 968b28b5dec |
10345276726764 has 48 divisors (see below), whose sum is σ = 28260268141056. Its totient is φ = 2883700828800.
The previous prime is 10345276726721. The next prime is 10345276726819. The reversal of 10345276726764 is 46762767254301.
It is a junction number, because it is equal to n+sod(n) for n = 10345276726698 and 10345276726707.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1501924072 + ... + 1501930959.
It is an arithmetic number, because the mean of its divisors is an integer number (588755586272).
Almost surely, 210345276726764 is an apocalyptic number.
10345276726764 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
10345276726764 is an abundant number, since it is smaller than the sum of its proper divisors (17914991414292).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10345276726764 is a wasteful number, since it uses less digits than its factorization.
10345276726764 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3003855086 (or 3003855084 counting only the distinct ones).
The product of its (nonzero) digits is 71124480, while the sum is 60.
The spelling of 10345276726764 in words is "ten trillion, three hundred forty-five billion, two hundred seventy-six million, seven hundred twenty-six thousand, seven hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •