Base | Representation |
---|---|
bin | 1100111111001000… |
… | …10000011100000000 |
3 | 122222220010210102200 |
4 | 12133210100130000 |
5 | 103234321033102 |
6 | 3111455113200 |
7 | 334526303625 |
oct | 63744203400 |
9 | 18886123380 |
10 | 6972049152 |
11 | 2a585a37a2 |
12 | 1426b12800 |
13 | 87159a893 |
14 | 4a1d6234c |
15 | 2ac14751c |
hex | 19f910700 |
6972049152 has 108 divisors (see below), whose sum is σ = 20795512920. Its totient is φ = 2243856384.
The previous prime is 6972049127. The next prime is 6972049169. The reversal of 6972049152 is 2519402796.
6972049152 is a `hidden beast` number, since 6 + 97 + 20 + 491 + 52 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 6972049098 and 6972049107.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 14643 + ... + 118989.
Almost surely, 26972049152 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 6972049152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10397756460).
6972049152 is an abundant number, since it is smaller than the sum of its proper divisors (13823463768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6972049152 is a wasteful number, since it uses less digits than its factorization.
6972049152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104398 (or 104381 counting only the distinct ones).
The product of its (nonzero) digits is 272160, while the sum is 45.
The square root of 6972049152 is about 83498.7973087038. The cubic root of 6972049152 is about 1910.3816888391.
The spelling of 6972049152 in words is "six billion, nine hundred seventy-two million, forty-nine thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •