Base | Representation |
---|---|
bin | 1000011101111011110… |
… | …1011000000111000001 |
3 | 111220111101000221121220 |
4 | 2013132331120013001 |
5 | 4340412441133012 |
6 | 150455144305253 |
7 | 13336665202026 |
oct | 2073675300701 |
9 | 456441027556 |
10 | 145474552257 |
11 | 567716572a1 |
12 | 2423b172229 |
13 | 10944b35a28 |
14 | 708073d54d |
15 | 3bb666608c |
hex | 21def581c1 |
145474552257 has 4 divisors (see below), whose sum is σ = 193966069680. Its totient is φ = 96983034836.
The previous prime is 145474552219. The next prime is 145474552261. The reversal of 145474552257 is 752255474541.
145474552257 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, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 145474552257 - 218 = 145474290113 is a prime.
It is not an unprimeable number, because it can be changed into a prime (145474552207) 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, 24245758707 + ... + 24245758712.
It is an arithmetic number, because the mean of its divisors is an integer number (48491517420).
Almost surely, 2145474552257 is an apocalyptic number.
It is an amenable number.
145474552257 is a deficient number, since it is larger than the sum of its proper divisors (48491517423).
145474552257 is an equidigital number, since it uses as much as digits as its factorization.
145474552257 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48491517422.
The product of its digits is 7840000, while the sum is 51.
The spelling of 145474552257 in words is "one hundred forty-five billion, four hundred seventy-four million, five hundred fifty-two thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.138 sec. • engine limits •