Base | Representation |
---|---|
bin | 1000011100111111101… |
… | …0000011000001011011 |
3 | 111212211202212001011012 |
4 | 2013033322003001123 |
5 | 4334403314134321 |
6 | 150414123524135 |
7 | 13330510545641 |
oct | 2071772030133 |
9 | 455752761135 |
10 | 145222021211 |
11 | 56652054a53 |
12 | 2418a68964b |
13 | 10904718287 |
14 | 7058da5191 |
15 | 3b9e3d205b |
hex | 21cfe8305b |
145222021211 has 8 divisors (see below), whose sum is σ = 145419603120. Its totient is φ = 145024494048.
The previous prime is 145222021193. The next prime is 145222021213. The reversal of 145222021211 is 112120222541.
145222021211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 145222021211 - 214 = 145222004827 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (145222021213) 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 7 ways as a sum of consecutive naturals, for example, 10344545 + ... + 10358573.
It is an arithmetic number, because the mean of its divisors is an integer number (18177450390).
Almost surely, 2145222021211 is an apocalyptic number.
145222021211 is a deficient number, since it is larger than the sum of its proper divisors (197581909).
145222021211 is a wasteful number, since it uses less digits than its factorization.
145222021211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27373.
The product of its (nonzero) digits is 640, while the sum is 23.
Adding to 145222021211 its reverse (112120222541), we get a palindrome (257342243752).
The spelling of 145222021211 in words is "one hundred forty-five billion, two hundred twenty-two million, twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •