Base | Representation |
---|---|
bin | 100001000000000101010100… |
… | …101110111101101110100111 |
3 | 201000220100221100211211211021 |
4 | 201000011110232331232213 |
5 | 123010443240331300320 |
6 | 1232404545335552011 |
7 | 42400052341304335 |
oct | 4100052456755647 |
9 | 630810840754737 |
10 | 145141251431335 |
11 | 42279071676815 |
12 | 1434141b52b607 |
13 | 62ca9b86c7b63 |
14 | 27bac3457cb55 |
15 | 11ba6cc728daa |
hex | 840154bbdba7 |
145141251431335 has 8 divisors (see below), whose sum is σ = 174210167048400. Its totient is φ = 116085890924544.
The previous prime is 145141251431303. The next prime is 145141251431413. The reversal of 145141251431335 is 533134152141541.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 145141251431335 - 25 = 145141251431303 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 145141251431291 and 145141251431300.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3388754010 + ... + 3388796839.
It is an arithmetic number, because the mean of its divisors is an integer number (21776270881050).
Almost surely, 2145141251431335 is an apocalyptic number.
145141251431335 is a deficient number, since it is larger than the sum of its proper divisors (29068915617065).
145141251431335 is an equidigital number, since it uses as much as digits as its factorization.
145141251431335 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6777555137.
The product of its digits is 432000, while the sum is 43.
The spelling of 145141251431335 in words is "one hundred forty-five trillion, one hundred forty-one billion, two hundred fifty-one million, four hundred thirty-one thousand, three hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •