Base | Representation |
---|---|
bin | 10011101001100100001… |
… | …011110000110100111011 |
3 | 11210002100202200102220112 |
4 | 103221210023300310323 |
5 | 134110403414123443 |
6 | 2512153002414535 |
7 | 166361464115630 |
oct | 23514413606473 |
9 | 4702322612815 |
10 | 1350300536123 |
11 | 4807284a5500 |
12 | 199844b0144b |
13 | 9a4431c1c96 |
14 | 494d7b8c187 |
15 | 251ced82b18 |
hex | 13a642f0d3b |
1350300536123 has 12 divisors (see below), whose sum is σ = 1696245302640. Its totient is φ = 1052182235280.
The previous prime is 1350300536093. The next prime is 1350300536191. The reversal of 1350300536123 is 3216350030531.
It is not a de Polignac number, because 1350300536123 - 26 = 1350300536059 is a prime.
It is a super-2 number, since 2×13503005361232 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1350300536123.
It is not an unprimeable number, because it can be changed into a prime (1350300536023) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 797106908 + ... + 797108601.
It is an arithmetic number, because the mean of its divisors is an integer number (141353775220).
Almost surely, 21350300536123 is an apocalyptic number.
1350300536123 is a deficient number, since it is larger than the sum of its proper divisors (345944766517).
1350300536123 is a wasteful number, since it uses less digits than its factorization.
1350300536123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1594215538 (or 1594215527 counting only the distinct ones).
The product of its (nonzero) digits is 24300, while the sum is 32.
Adding to 1350300536123 its reverse (3216350030531), we get a palindrome (4566650566654).
The spelling of 1350300536123 in words is "one trillion, three hundred fifty billion, three hundred million, five hundred thirty-six thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •