Base | Representation |
---|---|
bin | 10011101001100100110… |
… | …101101010110010010110 |
3 | 11210002101112100112220202 |
4 | 103221210311222302112 |
5 | 134110414222141210 |
6 | 2512154034100502 |
7 | 166361656361024 |
oct | 23514465526226 |
9 | 4702345315822 |
10 | 1350311521430 |
11 | 480733718973 |
12 | 19984871a732 |
13 | 9a44556a171 |
14 | 494d940b714 |
15 | 251d0d029a5 |
hex | 13a64d6ac96 |
1350311521430 has 16 divisors (see below), whose sum is σ = 2444610225744. Its totient is φ = 537002500320.
The previous prime is 1350311521393. The next prime is 1350311521439. The reversal of 1350311521430 is 341251130531.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1350311521393 and 1350311521402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1350311521439) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 390261716 + ... + 390265175.
It is an arithmetic number, because the mean of its divisors is an integer number (152788139109).
Almost surely, 21350311521430 is an apocalyptic number.
1350311521430 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1350311521430 is a deficient number, since it is larger than the sum of its proper divisors (1094298704314).
1350311521430 is a wasteful number, since it uses less digits than its factorization.
1350311521430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 780527071.
The product of its (nonzero) digits is 5400, while the sum is 29.
Adding to 1350311521430 its reverse (341251130531), we get a palindrome (1691562651961).
The spelling of 1350311521430 in words is "one trillion, three hundred fifty billion, three hundred eleven million, five hundred twenty-one thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •