Base | Representation |
---|---|
bin | 100001000000010001101100… |
… | …010001101110011001001101 |
3 | 201000221122012212022011022020 |
4 | 201000101230101232121031 |
5 | 123011202440004241141 |
6 | 1232415023210040353 |
7 | 42401032413434136 |
oct | 4100215421563115 |
9 | 630848185264266 |
10 | 145154531321421 |
11 | 4228376683a796 |
12 | 14343b06a190b9 |
13 | 62cc023a7619b |
14 | 27bb734164c8d |
15 | 11bac08516266 |
hex | 84046c46e64d |
145154531321421 has 16 divisors (see below), whose sum is σ = 195091733151744. Its totient is φ = 95993730597744.
The previous prime is 145154531321417. The next prime is 145154531321479. The reversal of 145154531321421 is 124123135451541.
It is not a de Polignac number, because 145154531321421 - 22 = 145154531321417 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145154571321421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 25141501 + ... + 30371106.
It is an arithmetic number, because the mean of its divisors is an integer number (12193233321984).
Almost surely, 2145154531321421 is an apocalyptic number.
It is an amenable number.
145154531321421 is a deficient number, since it is larger than the sum of its proper divisors (49937201830323).
145154531321421 is a wasteful number, since it uses less digits than its factorization.
145154531321421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55519600.
The product of its digits is 288000, while the sum is 42.
Adding to 145154531321421 its reverse (124123135451541), we get a palindrome (269277666772962).
The spelling of 145154531321421 in words is "one hundred forty-five trillion, one hundred fifty-four billion, five hundred thirty-one million, three hundred twenty-one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •