Base | Representation |
---|---|
bin | 10011000001010010… |
… | …10010010111011111 |
3 | 222100122111100220001 |
4 | 21200221102113133 |
5 | 131403102323323 |
6 | 4405133035131 |
7 | 511022134240 |
oct | 114051222737 |
9 | 28318440801 |
10 | 10211370463 |
11 | 4370063848 |
12 | 1b8b925aa7 |
13 | c69726058 |
14 | 6cc264cc7 |
15 | 3eb7113ad |
hex | 260a525df |
10211370463 has 8 divisors (see below), whose sum is σ = 11715548832. Its totient is φ = 8718544896.
The previous prime is 10211370443. The next prime is 10211370479. The reversal of 10211370463 is 36407311201.
10211370463 is digitally balanced in base 2 and base 3, because in such bases 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 a cyclic number.
It is not a de Polignac number, because 10211370463 - 221 = 10209273311 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10211370413) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 2836270 + ... + 2839867.
It is an arithmetic number, because the mean of its divisors is an integer number (1464443604).
Almost surely, 210211370463 is an apocalyptic number.
10211370463 is a deficient number, since it is larger than the sum of its proper divisors (1504178369).
10211370463 is an equidigital number, since it uses as much as digits as its factorization.
10211370463 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5676401.
The product of its (nonzero) digits is 3024, while the sum is 28.
Adding to 10211370463 its reverse (36407311201), we get a palindrome (46618681664).
The spelling of 10211370463 in words is "ten billion, two hundred eleven million, three hundred seventy thousand, four hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •