Base | Representation |
---|---|
bin | 11101100000111011110… |
… | …11000101100001000010 |
3 | 10120221121100222200012001 |
4 | 32300131323011201002 |
5 | 113103401230411320 |
6 | 2053513325054214 |
7 | 133160461260331 |
oct | 16603573054102 |
9 | 3527540880161 |
10 | 1014114310210 |
11 | 3610a10aa081 |
12 | 1446609b736a |
13 | 7482748b8a1 |
14 | 37124b97d18 |
15 | 1b5a592920a |
hex | ec1dec5842 |
1014114310210 has 16 divisors (see below), whose sum is σ = 1825741347192. Its totient is φ = 405571148800.
The previous prime is 1014114310169. The next prime is 1014114310229. The reversal of 1014114310210 is 120134114101.
It can be written as a sum of positive squares in 4 ways, for example, as 601042022361 + 413072287849 = 775269^2 + 642707^2 .
It is a super-2 number, since 2×10141143102102 (a number of 25 digits) contains 22 as substring.
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, 9264781 + ... + 9373600.
Almost surely, 21014114310210 is an apocalyptic number.
1014114310210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1014114310210 is a deficient number, since it is larger than the sum of its proper divisors (811627036982).
1014114310210 is a wasteful number, since it uses less digits than its factorization.
1014114310210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18643829.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 1014114310210 its reverse (120134114101), we get a palindrome (1134248424311).
The spelling of 1014114310210 in words is "one trillion, fourteen billion, one hundred fourteen million, three hundred ten thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •