Base | Representation |
---|---|
bin | 10100000001001110… |
… | …00010001001010000 |
3 | 1000202000121012222211 |
4 | 22000213002021100 |
5 | 134002344310030 |
6 | 4534251241504 |
7 | 530223344266 |
oct | 120047021120 |
9 | 30660535884 |
10 | 10747650640 |
11 | 4615850001 |
12 | 20bb449294 |
13 | 10238717bc |
14 | 73d582436 |
15 | 42d84412a |
hex | 2809c2250 |
10747650640 has 20 divisors (see below), whose sum is σ = 24988287924. Its totient is φ = 4299060224.
The previous prime is 10747650619. The next prime is 10747650649. The reversal of 10747650640 is 4605674701.
It can be written as a sum of positive squares in 2 ways, for example, as 7257676864 + 3489973776 = 85192^2 + 59076^2 .
It is a tau number, because it is divible by the number of its divisors (20).
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a junction number, because it is equal to n+sod(n) for n = 10747650593 and 10747650602.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10747650649) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 67172737 + ... + 67172896.
Almost surely, 210747650640 is an apocalyptic number.
10747650640 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10747650640 is an abundant number, since it is smaller than the sum of its proper divisors (14240637284).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10747650640 is a wasteful number, since it uses less digits than its factorization.
10747650640 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 134345646 (or 134345640 counting only the distinct ones).
The product of its (nonzero) digits is 141120, while the sum is 40.
The spelling of 10747650640 in words is "ten billion, seven hundred forty-seven million, six hundred fifty thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •