Base | Representation |
---|---|
bin | 1001000110010110101100… |
… | …0111111110001100011000 |
3 | 1022102110002001021110201120 |
4 | 2101211223013332030120 |
5 | 2302404240134143443 |
6 | 33140044121045240 |
7 | 2051551451366211 |
oct | 221455307761430 |
9 | 38373061243646 |
10 | 10004776084248 |
11 | 3208002303890 |
12 | 1156bab326820 |
13 | 5775a57a828a |
14 | 26833b584408 |
15 | 1253a93b9083 |
hex | 9196b1fe318 |
10004776084248 has 32 divisors (see below), whose sum is σ = 27285752957760. Its totient is φ = 3031750328480.
The previous prime is 10004776084241. The next prime is 10004776084271. The reversal of 10004776084248 is 84248067740001.
10004776084248 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 10004776084248.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10004776084241) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18948439290 + ... + 18948439817.
It is an arithmetic number, because the mean of its divisors is an integer number (852679779930).
Almost surely, 210004776084248 is an apocalyptic number.
It is an amenable number.
10004776084248 is an abundant number, since it is smaller than the sum of its proper divisors (17280976873512).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10004776084248 is a wasteful number, since it uses less digits than its factorization.
10004776084248 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37896879127 (or 37896879123 counting only the distinct ones).
The product of its (nonzero) digits is 2408448, while the sum is 51.
The spelling of 10004776084248 in words is "ten trillion, four billion, seven hundred seventy-six million, eighty-four thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •