Base | Representation |
---|---|
bin | 1001000110010110001010… |
… | …0000110110001100100010 |
3 | 1022102102200222102102111220 |
4 | 2101211202200312030202 |
5 | 2302403441143011041 |
6 | 33140021520315510 |
7 | 2051545045363005 |
oct | 221454240661442 |
9 | 38372628372456 |
10 | 10004631610146 |
11 | 3207a387a62a8 |
12 | 1156b6aa72b96 |
13 | 577581892644 |
14 | 2683262d753c |
15 | 12539b87bd66 |
hex | 91962836322 |
10004631610146 has 8 divisors (see below), whose sum is σ = 20009263220304. Its totient is φ = 3334877203380.
The previous prime is 10004631610139. The next prime is 10004631610159. The reversal of 10004631610146 is 64101613640001.
It is a sphenic number, since it is the product of 3 distinct primes.
10004631610146 is an admirable number.
It is a Curzon 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 3 ways as a sum of consecutive naturals, for example, 833719300840 + ... + 833719300851.
It is an arithmetic number, because the mean of its divisors is an integer number (2501157902538).
Almost surely, 210004631610146 is an apocalyptic number.
10004631610146 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10004631610146 is a wasteful number, since it uses less digits than its factorization.
10004631610146 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1667438601696.
The product of its (nonzero) digits is 10368, while the sum is 33.
The spelling of 10004631610146 in words is "ten trillion, four billion, six hundred thirty-one million, six hundred ten thousand, one hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •