Base | Representation |
---|---|
bin | 100001000100010011101011… |
… | …010010111011101100100110 |
3 | 201001221010020002110211010120 |
4 | 201010103223102323230212 |
5 | 123030222243301021210 |
6 | 1233150154404502410 |
7 | 42430040066462106 |
oct | 4104235322735446 |
9 | 631833202424116 |
10 | 145431540251430 |
11 | 423801960968a4 |
12 | 143897346aaa06 |
13 | 631c19b621464 |
14 | 27cacd1a61206 |
15 | 11c301c57b270 |
hex | 8444eb4bbb26 |
145431540251430 has 32 divisors (see below), whose sum is σ = 349381619071200. Its totient is φ = 38743308237312.
The previous prime is 145431540251377. The next prime is 145431540251449. The reversal of 145431540251430 is 34152045134541.
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 15 ways as a sum of consecutive naturals, for example, 2402208585 + ... + 2402269124.
It is an arithmetic number, because the mean of its divisors is an integer number (10918175595975).
Almost surely, 2145431540251430 is an apocalyptic number.
145431540251430 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
145431540251430 is an abundant number, since it is smaller than the sum of its proper divisors (203950078819770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145431540251430 is a wasteful number, since it uses less digits than its factorization.
145431540251430 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4804478728.
The product of its (nonzero) digits is 576000, while the sum is 42.
Adding to 145431540251430 its reverse (34152045134541), we get a palindrome (179583585385971).
The spelling of 145431540251430 in words is "one hundred forty-five trillion, four hundred thirty-one billion, five hundred forty million, two hundred fifty-one thousand, four hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •