Base | Representation |
---|---|
bin | 10101011011111001010… |
… | …010111101101000011010 |
3 | 12012211020011202001101021 |
4 | 111123321102331220122 |
5 | 143113312144004200 |
6 | 3044414240113054 |
7 | 211265555365435 |
oct | 25337122755032 |
9 | 5184204661337 |
10 | 1473061313050 |
11 | 5187a3788148 |
12 | 1b95a530578a |
13 | a8ba8352562 |
14 | 51421a2881c |
15 | 284b73c641a |
hex | 156f94bda1a |
1473061313050 has 12 divisors (see below), whose sum is σ = 2739894042366. Its totient is φ = 589224525200.
The previous prime is 1473061312997. The next prime is 1473061313051. The reversal of 1473061313050 is 503131603741.
It can be written as a sum of positive squares in 3 ways, for example, as 762811838881 + 710249474169 = 873391^2 + 842763^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1473061312997 and 1473061313015.
It is not an unprimeable number, because it can be changed into a prime (1473061313051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 14730613081 + ... + 14730613180.
Almost surely, 21473061313050 is an apocalyptic number.
1473061313050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1473061313050 is a deficient number, since it is larger than the sum of its proper divisors (1266832729316).
1473061313050 is a wasteful number, since it uses less digits than its factorization.
1473061313050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29461226273 (or 29461226268 counting only the distinct ones).
The product of its (nonzero) digits is 22680, while the sum is 34.
Adding to 1473061313050 its reverse (503131603741), we get a palindrome (1976192916791).
The spelling of 1473061313050 in words is "one trillion, four hundred seventy-three billion, sixty-one million, three hundred thirteen thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •