Base | Representation |
---|---|
bin | 10011101010110011111… |
… | …000011011001100010010 |
3 | 11210012210221200120011100 |
4 | 103222303320123030102 |
5 | 134121123214102200 |
6 | 2512533405325230 |
7 | 166436561260521 |
oct | 23526370331422 |
9 | 4705727616140 |
10 | 1351637644050 |
11 | 481254238481 |
12 | 199b58866816 |
13 | 9a5c72202c5 |
14 | 495c35ac4b8 |
15 | 2525c452d00 |
hex | 13ab3e1b312 |
1351637644050 has 72 divisors (see below), whose sum is σ = 3634985827044. Its totient is φ = 360080772480.
The previous prime is 1351637644039. The next prime is 1351637644099. The reversal of 1351637644050 is 504467361531.
1351637644050 is a `hidden beast` number, since 1 + 3 + 5 + 1 + 637 + 6 + 4 + 4 + 0 + 5 + 0 = 666.
It can be written as a sum of positive squares in 6 ways, for example, as 15401058201 + 1336236585849 = 124101^2 + 1155957^2 .
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a junction number, because it is equal to n+sod(n) for n = 1351637643987 and 1351637644005.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 1026697 + ... + 1938396.
Almost surely, 21351637644050 is an apocalyptic number.
1351637644050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1351637644050 is an abundant number, since it is smaller than the sum of its proper divisors (2283348182994).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1351637644050 is a wasteful number, since it uses less digits than its factorization.
1351637644050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2966124 (or 2966116 counting only the distinct ones).
The product of its (nonzero) digits is 907200, while the sum is 45.
The spelling of 1351637644050 in words is "one trillion, three hundred fifty-one billion, six hundred thirty-seven million, six hundred forty-four thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •