Base | Representation |
---|---|
bin | 10010111100001001110… |
… | …110101010011010101001 |
3 | 11121102111120220122112221 |
4 | 102330021312222122221 |
5 | 132311023321241040 |
6 | 2433530332034041 |
7 | 163014245663545 |
oct | 22741166523251 |
9 | 4542446818487 |
10 | 1301540415145 |
11 | 461a866a6963 |
12 | 1902b7302921 |
13 | 9597229a1a9 |
14 | 46dcddaca25 |
15 | 23cc92a474a |
hex | 12f09daa6a9 |
1301540415145 has 8 divisors (see below), whose sum is σ = 1567654628040. Its totient is φ = 1037361578880.
The previous prime is 1301540415127. The next prime is 1301540415157. The reversal of 1301540415145 is 5415140451031.
It can be written as a sum of positive squares in 4 ways, for example, as 54986029081 + 1246554386064 = 234491^2 + 1116492^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1301540415145 - 29 = 1301540414633 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1301540415145.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 483842676 + ... + 483845365.
It is an arithmetic number, because the mean of its divisors is an integer number (195956828505).
Almost surely, 21301540415145 is an apocalyptic number.
It is an amenable number.
1301540415145 is a deficient number, since it is larger than the sum of its proper divisors (266114212895).
1301540415145 is an equidigital number, since it uses as much as digits as its factorization.
1301540415145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 967688315.
The product of its (nonzero) digits is 24000, while the sum is 34.
Adding to 1301540415145 its reverse (5415140451031), we get a palindrome (6716680866176).
The spelling of 1301540415145 in words is "one trillion, three hundred one billion, five hundred forty million, four hundred fifteen thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •