Base | Representation |
---|---|
bin | 1100110111110000… |
… | …00011010000000000 |
3 | 122211120121221011100 |
4 | 12123320003100000 |
5 | 103122443113102 |
6 | 3101404014400 |
7 | 333145062063 |
oct | 63370032000 |
9 | 18746557140 |
10 | 6910129152 |
11 | 2a26651343 |
12 | 140a231400 |
13 | 8617caa24 |
14 | 497a448da |
15 | 2a69b5a1c |
hex | 19be03400 |
6910129152 has 396 divisors, whose sum is σ = 22062009216. Its totient is φ = 2080235520.
The previous prime is 6910129141. The next prime is 6910129157. The reversal of 6910129152 is 2519210196.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6910129157) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 103136223 + ... + 103136289.
Almost surely, 26910129152 is an apocalyptic number.
6910129152 is a gapful number since it is divisible by the number (62) 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 6910129152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11031004608).
6910129152 is an abundant number, since it is smaller than the sum of its proper divisors (15151880064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6910129152 is a wasteful number, since it uses less digits than its factorization.
6910129152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 162 (or 122 counting only the distinct ones).
The product of its (nonzero) digits is 9720, while the sum is 36.
The square root of 6910129152 is about 83127.1865998122. The cubic root of 6910129152 is about 1904.7093842331.
The spelling of 6910129152 in words is "six billion, nine hundred ten million, one hundred twenty-nine thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •