Base | Representation |
---|---|
bin | 1000000011010110100… |
… | …11001101001111000100 |
3 | 222110011011122221212100 |
4 | 10001223103031033010 |
5 | 14013114043312004 |
6 | 331034255552100 |
7 | 25663225036431 |
oct | 4015323151704 |
9 | 873134587770 |
10 | 276678104004 |
11 | a737a638695 |
12 | 45756b2b630 |
13 | 20124176553 |
14 | d5699c0b88 |
15 | 72e4eb7739 |
hex | 406b4cd3c4 |
276678104004 has 81 divisors (see below), whose sum is σ = 724568632333. Its totient is φ = 89016370464.
The previous prime is 276678103997. The next prime is 276678104029. The reversal of 276678104004 is 400401876672.
The square root of 276678104004 is 526002.
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., 145083286404 + 131594817600 = 380898^2 + 362760^2 .
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 91522837 + ... + 91525859.
Almost surely, 2276678104004 is an apocalyptic number.
276678104004 is the 526002-nd square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 276678104004
276678104004 is an abundant number, since it is smaller than the sum of its proper divisors (447890528329).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
276678104004 is an equidigital number, since it uses as much as digits as its factorization.
276678104004 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6114 (or 3057 counting only the distinct ones).
The product of its (nonzero) digits is 451584, while the sum is 45.
The spelling of 276678104004 in words is "two hundred seventy-six billion, six hundred seventy-eight million, one hundred four thousand, four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •