Base | Representation |
---|---|
bin | 1000011101000101000… |
… | …1111010000111100011 |
3 | 111212220101012012101122 |
4 | 2013101101322013203 |
5 | 4334430213202121 |
6 | 150420305322455 |
7 | 13331210404133 |
oct | 2072121720743 |
9 | 455811165348 |
10 | 145245053411 |
11 | 56664056427 |
12 | 2419633642b |
13 | 109094208b3 |
14 | 705c07cac3 |
15 | 3ba14315ab |
hex | 21d147a1e3 |
145245053411 has 4 divisors (see below), whose sum is σ = 145247269392. Its totient is φ = 145242837432.
The previous prime is 145245053399. The next prime is 145245053413. The reversal of 145245053411 is 114350542541.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 114350542541 = 137 ⋅834675493.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-145245053411 is a prime.
It is a super-2 number, since 2×1452450534112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (145245053413) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1006580 + ... + 1141793.
It is an arithmetic number, because the mean of its divisors is an integer number (36311817348).
Almost surely, 2145245053411 is an apocalyptic number.
145245053411 is a deficient number, since it is larger than the sum of its proper divisors (2215981).
145245053411 is an equidigital number, since it uses as much as digits as its factorization.
145245053411 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2215980.
The product of its (nonzero) digits is 48000, while the sum is 35.
Adding to 145245053411 its reverse (114350542541), we get a palindrome (259595595952).
The spelling of 145245053411 in words is "one hundred forty-five billion, two hundred forty-five million, fifty-three thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.991 sec. • engine limits •