Base | Representation |
---|---|
bin | 1001010110010101110000… |
… | …0010001110100100011100 |
3 | 1100101200221010011212201020 |
4 | 2111211130002032210130 |
5 | 2321404203102432124 |
6 | 33510142550244140 |
7 | 2110443064240320 |
oct | 225453402164434 |
9 | 40350833155636 |
10 | 10279400827164 |
11 | 3303518868937 |
12 | 11a0272656650 |
13 | 597460413261 |
14 | 277750579980 |
15 | 12c5cde7d379 |
hex | 9595c08e91c |
10279400827164 has 48 divisors (see below), whose sum is σ = 29024190574848. Its totient is φ = 2764208625408.
The previous prime is 10279400827133. The next prime is 10279400827177. The reversal of 10279400827164 is 46172800497201.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3599228554 + ... + 3599231409.
It is an arithmetic number, because the mean of its divisors is an integer number (604670636976).
Almost surely, 210279400827164 is an apocalyptic number.
10279400827164 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
10279400827164 is an abundant number, since it is smaller than the sum of its proper divisors (18744789747684).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10279400827164 is a wasteful number, since it uses less digits than its factorization.
10279400827164 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7198459994 (or 7198459992 counting only the distinct ones).
The product of its (nonzero) digits is 1354752, while the sum is 51.
The spelling of 10279400827164 in words is "ten trillion, two hundred seventy-nine billion, four hundred million, eight hundred twenty-seven thousand, one hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.222 sec. • engine limits •