Base | Representation |
---|---|
bin | 1000011101111010100… |
… | …0110011100111010011 |
3 | 111220110222212222200122 |
4 | 2013132220303213103 |
5 | 4340410101104031 |
6 | 150454432540455 |
7 | 13336601312606 |
oct | 2073650634723 |
9 | 456428788618 |
10 | 145469159891 |
11 | 567696039a0 |
12 | 242393b172b |
13 | 10943998493 |
14 | 707db3833d |
15 | 3bb5e4d47b |
hex | 21dea339d3 |
145469159891 has 8 divisors (see below), whose sum is σ = 158696459184. Its totient is φ = 132242332320.
The previous prime is 145469159867. The next prime is 145469159893. The reversal of 145469159891 is 198951964541.
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 145469159891 - 210 = 145469158867 is a prime.
It is a super-2 number, since 2×1454691598912 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (145469159893) 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, 937925 + ... + 1081961.
It is an arithmetic number, because the mean of its divisors is an integer number (19837057398).
Almost surely, 2145469159891 is an apocalyptic number.
145469159891 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
145469159891 is a deficient number, since it is larger than the sum of its proper divisors (13227299293).
145469159891 is a wasteful number, since it uses less digits than its factorization.
145469159891 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 235861.
The product of its digits is 13996800, while the sum is 62.
The spelling of 145469159891 in words is "one hundred forty-five billion, four hundred sixty-nine million, one hundred fifty-nine thousand, eight hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.025 sec. • engine limits •