Base | Representation |
---|---|
bin | 1001010010101001110110… |
… | …0011011110010000011011 |
3 | 1100011122110212111120200010 |
4 | 2110222131203132100123 |
5 | 2314340010320124041 |
6 | 33421111134013003 |
7 | 2103041606260215 |
oct | 224523543362033 |
9 | 40148425446603 |
10 | 10216075551771 |
11 | 32896823531a1 |
12 | 118bb3b047163 |
13 | 5914aaa943bb |
14 | 27466420b5b5 |
15 | 12ab24833a16 |
hex | 94a9d8de41b |
10216075551771 has 8 divisors (see below), whose sum is σ = 13692011448400. Its totient is φ = 6775428344832.
The previous prime is 10216075551733. The next prime is 10216075551797. The reversal of 10216075551771 is 17715557061201.
10216075551771 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10216075551771 - 29 = 10216075551259 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 10216075551771.
It is not an unprimeable number, because it can be changed into a prime (10216075551701) 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, 8822171746 + ... + 8822172903.
It is an arithmetic number, because the mean of its divisors is an integer number (1711501431050).
Almost surely, 210216075551771 is an apocalyptic number.
10216075551771 is a deficient number, since it is larger than the sum of its proper divisors (3475935896629).
10216075551771 is a wasteful number, since it uses less digits than its factorization.
10216075551771 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17644344845.
The product of its (nonzero) digits is 514500, while the sum is 48.
The spelling of 10216075551771 in words is "ten trillion, two hundred sixteen billion, seventy-five million, five hundred fifty-one thousand, seven hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •