Base | Representation |
---|---|
bin | 10011101001100000110… |
… | …101101100100111010011 |
3 | 11210002012212002110010111 |
4 | 103221200311230213103 |
5 | 134110300032420201 |
6 | 2512143235542151 |
7 | 166360213126132 |
oct | 23514065544723 |
9 | 4702185073114 |
10 | 1350244420051 |
11 | 4806a985768a |
12 | 19982a15a957 |
13 | 9a4346a4ac7 |
14 | 494d0541919 |
15 | 251c9e9ab51 |
hex | 13a60d6c9d3 |
1350244420051 has 4 divisors (see below), whose sum is σ = 1350253815112. Its totient is φ = 1350235024992.
The previous prime is 1350244420039. The next prime is 1350244420073. The reversal of 1350244420051 is 1500244420531.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1350244420051 - 239 = 800488606163 is a prime.
It is a super-2 number, since 2×13502444200512 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1350244419995 and 1350244420022.
It is not an unprimeable number, because it can be changed into a prime (1350244420451) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4478550 + ... + 4770523.
It is an arithmetic number, because the mean of its divisors is an integer number (337563453778).
Almost surely, 21350244420051 is an apocalyptic number.
1350244420051 is a deficient number, since it is larger than the sum of its proper divisors (9395061).
1350244420051 is an equidigital number, since it uses as much as digits as its factorization.
1350244420051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9395060.
The product of its (nonzero) digits is 19200, while the sum is 31.
Adding to 1350244420051 its reverse (1500244420531), we get a palindrome (2850488840582).
The spelling of 1350244420051 in words is "one trillion, three hundred fifty billion, two hundred forty-four million, four hundred twenty thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •