Base | Representation |
---|---|
bin | 10100100101000001101… |
… | …011001000011010000010 |
3 | 12000012011021022102000002 |
4 | 110211001223020122002 |
5 | 141132132343103200 |
6 | 3001352202000002 |
7 | 204111600142064 |
oct | 24450153103202 |
9 | 5005137272002 |
10 | 1414146066050 |
11 | 4a5810651073 |
12 | 1aa0a27a6002 |
13 | a3479568163 |
14 | 4c633265734 |
15 | 26bb9ee6bd5 |
hex | 14941ac8682 |
1414146066050 has 24 divisors (see below), whose sum is σ = 2721012088500. Its totient is φ = 546152962880.
The previous prime is 1414146066043. The next prime is 1414146066097. The reversal of 1414146066050 is 506606414141.
It can be written as a sum of positive squares in 6 ways, for example, as 954194895241 + 459951170809 = 976829^2 + 678197^2 .
It is a super-2 number, since 2×14141460660502 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1414146065995 and 1414146066013.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 487635125 + ... + 487638024.
Almost surely, 21414146066050 is an apocalyptic number.
1414146066050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1414146066050 is a deficient number, since it is larger than the sum of its proper divisors (1306866022450).
1414146066050 is a wasteful number, since it uses less digits than its factorization.
1414146066050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 975273190 (or 975273185 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 38.
The spelling of 1414146066050 in words is "one trillion, four hundred fourteen billion, one hundred forty-six million, sixty-six thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •