Base | Representation |
---|---|
bin | 100001000001001111111101… |
… | …111111011010101101111100 |
3 | 201001012000211002110122201221 |
4 | 201001033331333122231330 |
5 | 123013301412012131322 |
6 | 1232505442420443124 |
7 | 42405620453220553 |
oct | 4101177577325574 |
9 | 631160732418657 |
10 | 145221400505212 |
11 | 422aa060742249 |
12 | 14354a692494a4 |
13 | 630541c696165 |
14 | 27c0a79040d9a |
15 | 11bc81dd429c7 |
hex | 8413fdfdab7c |
145221400505212 has 24 divisors (see below), whose sum is σ = 271601541805104. Its totient is φ = 67700795834112.
The previous prime is 145221400505179. The next prime is 145221400505219. The reversal of 145221400505212 is 212505004122541.
It is a Harshad number since it is a multiple of its sum of digits (34).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (145221400505219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9979473243 + ... + 9979487794.
It is an arithmetic number, because the mean of its divisors is an integer number (11316730908546).
Almost surely, 2145221400505212 is an apocalyptic number.
It is an amenable number.
145221400505212 is a deficient number, since it is larger than the sum of its proper divisors (126380141299892).
145221400505212 is a wasteful number, since it uses less digits than its factorization.
145221400505212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19958961165 (or 19958961163 counting only the distinct ones).
The product of its (nonzero) digits is 32000, while the sum is 34.
Adding to 145221400505212 its reverse (212505004122541), we get a palindrome (357726404627753).
The spelling of 145221400505212 in words is "one hundred forty-five trillion, two hundred twenty-one billion, four hundred million, five hundred five thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •