Base | Representation |
---|---|
bin | 1000011100111101110… |
… | …0101000111001001100 |
3 | 111212211020100101010022 |
4 | 2013033130220321030 |
5 | 4334344330441022 |
6 | 150413250401312 |
7 | 13330355200100 |
oct | 2071734507114 |
9 | 455736311108 |
10 | 145214312012 |
11 | 56648769a10 |
12 | 24187b90238 |
13 | 10902c49313 |
14 | 7057d59900 |
15 | 3b9d8acc42 |
hex | 21cf728e4c |
145214312012 has 72 divisors (see below), whose sum is σ = 327775927248. Its totient is φ = 55649462400.
The previous prime is 145214311993. The next prime is 145214312017. The reversal of 145214312012 is 210213412541.
It is a happy number.
145214312012 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (145214312017) 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 23 ways as a sum of consecutive naturals, for example, 420563 + ... + 683594.
It is an arithmetic number, because the mean of its divisors is an integer number (4552443434).
Almost surely, 2145214312012 is an apocalyptic number.
It is an amenable number.
145214312012 is an abundant number, since it is smaller than the sum of its proper divisors (182561615236).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
145214312012 is a wasteful number, since it uses less digits than its factorization.
145214312012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1104247 (or 1104238 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 26.
Adding to 145214312012 its reverse (210213412541), we get a palindrome (355427724553).
The spelling of 145214312012 in words is "one hundred forty-five billion, two hundred fourteen million, three hundred twelve thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •