Base | Representation |
---|---|
bin | 1000011101110001001… |
… | …1111010111000110011 |
3 | 111220101021110002001112 |
4 | 2013130103322320303 |
5 | 4340320103131402 |
6 | 150450520223535 |
7 | 13335615465524 |
oct | 2073423727063 |
9 | 456337402045 |
10 | 145430130227 |
11 | 56749576378 |
12 | 2422830abab |
13 | 109388814c5 |
14 | 707889884b |
15 | 3bb27dde52 |
hex | 21dc4fae33 |
145430130227 has 8 divisors (see below), whose sum is σ = 149228457840. Its totient is φ = 141643767040.
The previous prime is 145430130211. The next prime is 145430130229. The reversal of 145430130227 is 722031034541.
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 145430130227 - 24 = 145430130211 is a prime.
It is a super-2 number, since 2×1454301302272 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 145430130193 and 145430130202.
It is not an unprimeable number, because it can be changed into a prime (145430130229) 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, 2966477 + ... + 3015102.
It is an arithmetic number, because the mean of its divisors is an integer number (18653557230).
Almost surely, 2145430130227 is an apocalyptic number.
145430130227 is a deficient number, since it is larger than the sum of its proper divisors (3798327613).
145430130227 is an equidigital number, since it uses as much as digits as its factorization.
145430130227 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5982213.
The product of its (nonzero) digits is 20160, while the sum is 32.
Adding to 145430130227 its reverse (722031034541), we get a palindrome (867461164768).
The spelling of 145430130227 in words is "one hundred forty-five billion, four hundred thirty million, one hundred thirty thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •