Base | Representation |
---|---|
bin | 101101100110101011111… |
… | …1100010001010010010000 |
3 | 211012012101001000112110111 |
4 | 1123031113330101102100 |
5 | 1310143010132431341 |
6 | 21155222543211104 |
7 | 1214556510630100 |
oct | 133152774212220 |
9 | 24165331015414 |
10 | 6267832702096 |
11 | 1aa719a181729 |
12 | 8528b85a6a94 |
13 | 366091aa4b04 |
14 | 179516b1d200 |
15 | ad092610681 |
hex | 5b357f11490 |
6267832702096 has 45 divisors (see below), whose sum is σ = 14126765627961. Its totient is φ = 2686183972416.
The previous prime is 6267832702067. The next prime is 6267832702099. The reversal of 6267832702096 is 6902072387626.
The square root of 6267832702096 is 2503564.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 2789100403600 + 3478732298496 = 1670060^2 + 1865136^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 6267832702096.
It is not an unprimeable number, because it can be changed into a prime (6267832702099) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 70055086 + ... + 70144498.
Almost surely, 26267832702096 is an apocalyptic number.
6267832702096 is the 2503564-th square number.
It is an amenable number.
6267832702096 is an abundant number, since it is smaller than the sum of its proper divisors (7858932925865).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6267832702096 is an frugal number, since it uses more digits than its factorization.
6267832702096 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 178848 (or 89422 counting only the distinct ones).
The product of its (nonzero) digits is 18289152, while the sum is 58.
The spelling of 6267832702096 in words is "six trillion, two hundred sixty-seven billion, eight hundred thirty-two million, seven hundred two thousand, ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •