Base | Representation |
---|---|
bin | 10011101010001101111… |
… | …000100000001111001001 |
3 | 11210011011112002111222120 |
4 | 103222031320200033021 |
5 | 134113322013134010 |
6 | 2512350233241453 |
7 | 166415020430454 |
oct | 23521570401711 |
9 | 4704145074876 |
10 | 1351000130505 |
11 | 480a57398083 |
12 | 1999bb263289 |
13 | 9a52511b85c |
14 | 49562a5c49b |
15 | 252214c4e70 |
hex | 13a8de203c9 |
1351000130505 has 8 divisors (see below), whose sum is σ = 2161600208832. Its totient is φ = 720533402928.
The previous prime is 1351000130449. The next prime is 1351000130527. The reversal of 1351000130505 is 5050310001531.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1351000130505 - 215 = 1351000097737 is a prime.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 45033337669 + ... + 45033337698.
It is an arithmetic number, because the mean of its divisors is an integer number (270200026104).
Almost surely, 21351000130505 is an apocalyptic number.
1351000130505 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1351000130505 is a deficient number, since it is larger than the sum of its proper divisors (810600078327).
1351000130505 is an equidigital number, since it uses as much as digits as its factorization.
1351000130505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90066675375.
The product of its (nonzero) digits is 1125, while the sum is 24.
The spelling of 1351000130505 in words is "one trillion, three hundred fifty-one billion, one hundred thirty thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •