Base | Representation |
---|---|
bin | 1001110011011001101100… |
… | …0001010000100100001100 |
3 | 1102011102122022020221112212 |
4 | 2130312123001100210030 |
5 | 2403044210434303030 |
6 | 34531353201445552 |
7 | 2161506404066261 |
oct | 234663301204414 |
9 | 42142568227485 |
10 | 10778673744140 |
11 | 3486234369075 |
12 | 1260b900408b8 |
13 | 602569a2b593 |
14 | 293994db5268 |
15 | 13a5a0d3e595 |
hex | 9cd9b05090c |
10778673744140 has 12 divisors (see below), whose sum is σ = 22635214862736. Its totient is φ = 4311469497648.
The previous prime is 10778673744067. The next prime is 10778673744169. The reversal of 10778673744140 is 4144737687701.
It is a super-2 number, since 2×107786737441402 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10778673744140.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 269466843584 + ... + 269466843623.
It is an arithmetic number, because the mean of its divisors is an integer number (1886267905228).
Almost surely, 210778673744140 is an apocalyptic number.
10778673744140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10778673744140 is an abundant number, since it is smaller than the sum of its proper divisors (11856541118596).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10778673744140 is a wasteful number, since it uses less digits than its factorization.
10778673744140 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 538933687216 (or 538933687214 counting only the distinct ones).
The product of its (nonzero) digits is 22127616, while the sum is 59.
The spelling of 10778673744140 in words is "ten trillion, seven hundred seventy-eight billion, six hundred seventy-three million, seven hundred forty-four thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •