Base | Representation |
---|---|
bin | 1000011110000011001… |
… | …0011111010000111011 |
3 | 111220120111210200022122 |
4 | 2013200302133100323 |
5 | 4340443321034121 |
6 | 150502202311455 |
7 | 13340520144611 |
oct | 2074062372073 |
9 | 456514720278 |
10 | 145505252411 |
11 | 56787a15822 |
12 | 242494b858b |
13 | 1094b2c45bc |
14 | 70848516b1 |
15 | 3bb91cc5ab |
hex | 21e0c9f43b |
145505252411 has 4 divisors (see below), whose sum is σ = 146046164400. Its totient is φ = 144964340424.
The previous prime is 145505252407. The next prime is 145505252419. The reversal of 145505252411 is 114252505541.
145505252411 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 145505252411 - 22 = 145505252407 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (145505252419) 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 3 ways as a sum of consecutive naturals, for example, 270455591 + ... + 270456128.
It is an arithmetic number, because the mean of its divisors is an integer number (36511541100).
Almost surely, 2145505252411 is an apocalyptic number.
145505252411 is a deficient number, since it is larger than the sum of its proper divisors (540911989).
145505252411 is an equidigital number, since it uses as much as digits as its factorization.
145505252411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 540911988.
The product of its (nonzero) digits is 40000, while the sum is 35.
Adding to 145505252411 its reverse (114252505541), we get a palindrome (259757757952).
The spelling of 145505252411 in words is "one hundred forty-five billion, five hundred five million, two hundred fifty-two thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •