Base | Representation |
---|---|
bin | 10100000010010001… |
… | …10000011101000000 |
3 | 1000202122020100210020 |
4 | 22001020300131000 |
5 | 134012130203242 |
6 | 4535204533440 |
7 | 530361444165 |
oct | 120110603500 |
9 | 30678210706 |
10 | 10756491072 |
11 | 461a838a48 |
12 | 21023b1280 |
13 | 1025648622 |
14 | 74080406c |
15 | 42e4dd6ec |
hex | 281230740 |
10756491072 has 112 divisors (see below), whose sum is σ = 29028542400. Its totient is φ = 3514224640.
The previous prime is 10756491043. The next prime is 10756491101. The reversal of 10756491072 is 27019465701.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (10756491043) and next prime (10756491101).
It is a super-3 number, since 3×107564910723 (a number of 31 digits) contains 333 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4405372 + ... + 4407812.
Almost surely, 210756491072 is an apocalyptic number.
10756491072 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10756491072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14514271200).
10756491072 is an abundant number, since it is smaller than the sum of its proper divisors (18272051328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10756491072 is a wasteful number, since it uses less digits than its factorization.
10756491072 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2904 (or 2894 counting only the distinct ones).
The product of its (nonzero) digits is 105840, while the sum is 42.
The spelling of 10756491072 in words is "ten billion, seven hundred fifty-six million, four hundred ninety-one thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •