Base | Representation |
---|---|
bin | 1000011101111100010… |
… | …0110100101100100001 |
3 | 111220111111201010101202 |
4 | 2013133010310230201 |
5 | 4340413441114403 |
6 | 150455254210545 |
7 | 13340020612205 |
oct | 2073704645441 |
9 | 456444633352 |
10 | 145476504353 |
11 | 5677276a9a4 |
12 | 2423b953a55 |
13 | 1094536a40b |
14 | 7080acab05 |
15 | 3bb68ee688 |
hex | 21df134b21 |
145476504353 has 4 divisors (see below), whose sum is σ = 150169294848. Its totient is φ = 140783713860.
The previous prime is 145476504311. The next prime is 145476504373. The reversal of 145476504353 is 353405674541.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 353405674541 = 883 ⋅400232927.
It is a cyclic number.
It is not a de Polignac number, because 145476504353 - 214 = 145476487969 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 145476504298 and 145476504307.
It is not an unprimeable number, because it can be changed into a prime (145476504373) 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, 2346395201 + ... + 2346395262.
It is an arithmetic number, because the mean of its divisors is an integer number (37542323712).
Almost surely, 2145476504353 is an apocalyptic number.
It is an amenable number.
145476504353 is a deficient number, since it is larger than the sum of its proper divisors (4692790495).
145476504353 is an equidigital number, since it uses as much as digits as its factorization.
145476504353 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4692790494.
The product of its (nonzero) digits is 3024000, while the sum is 47.
The spelling of 145476504353 in words is "one hundred forty-five billion, four hundred seventy-six million, five hundred four thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •