Base | Representation |
---|---|
bin | 1001010010100011000011… |
… | …0101010001011010010101 |
3 | 1100011110202202020012200202 |
4 | 2110220300311101122111 |
5 | 2314322241341014310 |
6 | 33420210134150245 |
7 | 2102645450143433 |
oct | 224506065213225 |
9 | 40143682205622 |
10 | 10214251501205 |
11 | 3288926761a94 |
12 | 118b7101b2385 |
13 | 591279c0333b |
14 | 27452dc73d53 |
15 | 12aa696293a5 |
hex | 94a30d51695 |
10214251501205 has 8 divisors (see below), whose sum is σ = 12257184708000. Its totient is φ = 8171345929936.
The previous prime is 10214251501199. The next prime is 10214251501219. The reversal of 10214251501205 is 50210515241201.
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 10214251501205 - 24 = 10214251501189 is a prime.
It is a super-2 number, since 2×102142515012052 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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, 6086855 + ... + 7581444.
It is an arithmetic number, because the mean of its divisors is an integer number (1532148088500).
Almost surely, 210214251501205 is an apocalyptic number.
It is an amenable number.
10214251501205 is a deficient number, since it is larger than the sum of its proper divisors (2042933206795).
10214251501205 is a wasteful number, since it uses less digits than its factorization.
10214251501205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13817763.
The product of its (nonzero) digits is 4000, while the sum is 29.
Adding to 10214251501205 its reverse (50210515241201), we get a palindrome (60424766742406).
The spelling of 10214251501205 in words is "ten trillion, two hundred fourteen billion, two hundred fifty-one million, five hundred one thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •