Base | Representation |
---|---|
bin | 1001101111001100001011… |
… | …0110001001000111011010 |
3 | 1101220111220100222200000021 |
4 | 2123303002312021013122 |
5 | 2400403024313142100 |
6 | 34434230254101054 |
7 | 2153335526665633 |
oct | 233630266110732 |
9 | 41814810880007 |
10 | 10706327474650 |
11 | 3458589823005 |
12 | 124ab5b4aa78a |
13 | 5c87aa48b6b2 |
14 | 29029092888a |
15 | 13876976ca1a |
hex | 9bcc2d891da |
10706327474650 has 12 divisors (see below), whose sum is σ = 19913769102942. Its totient is φ = 4282530989840.
The previous prime is 10706327474627. The next prime is 10706327474659. The reversal of 10706327474650 is 5647472360701.
10706327474650 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 3 ways, for example, as 10463368192369 + 242959282281 = 3234713^2 + 492909^2 .
It is a super-2 number, since 2×107063274746502 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10706327474659) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 107063274697 + ... + 107063274796.
Almost surely, 210706327474650 is an apocalyptic number.
10706327474650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10706327474650 is a deficient number, since it is larger than the sum of its proper divisors (9207441628292).
10706327474650 is a wasteful number, since it uses less digits than its factorization.
10706327474650 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 214126549505 (or 214126549500 counting only the distinct ones).
The product of its (nonzero) digits is 5927040, while the sum is 52.
The spelling of 10706327474650 in words is "ten trillion, seven hundred six billion, three hundred twenty-seven million, four hundred seventy-four thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •