Base | Representation |
---|---|
bin | 1001001001000011010010… |
… | …0010110010000111101101 |
3 | 1022120212122210022112210122 |
4 | 2102100310202302013231 |
5 | 2304134130340143221 |
6 | 33213225222414325 |
7 | 2055111515623130 |
oct | 222206442620755 |
9 | 38525583275718 |
10 | 10051105006061 |
11 | 3225716820519 |
12 | 1163b7a8913a5 |
13 | 57ba79b0c692 |
14 | 26a694502217 |
15 | 1266bb80beab |
hex | 924348b21ed |
10051105006061 has 8 divisors (see below), whose sum is σ = 11493698624640. Its totient is φ = 8610191756208.
The previous prime is 10051105006037. The next prime is 10051105006069. The reversal of 10051105006061 is 16060050115001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10051105006061 - 218 = 10051104743917 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10051105006061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10051105006069) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 420079361 + ... + 420103286.
It is an arithmetic number, because the mean of its divisors is an integer number (1436712328080).
Almost surely, 210051105006061 is an apocalyptic number.
It is an amenable number.
10051105006061 is a deficient number, since it is larger than the sum of its proper divisors (1442593618579).
10051105006061 is an equidigital number, since it uses as much as digits as its factorization.
10051105006061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 840184363.
The product of its (nonzero) digits is 900, while the sum is 26.
The spelling of 10051105006061 in words is "ten trillion, fifty-one billion, one hundred five million, six thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •