Base | Representation |
---|---|
bin | 1111101101011001100001… |
… | …10101100011000010100101 |
3 | 11112022111022021002121022001 |
4 | 13312230300311203002211 |
5 | 14011442123233232003 |
6 | 201245510442405301 |
7 | 10163545166130100 |
oct | 766546065430245 |
9 | 145274267077261 |
10 | 34545241305253 |
11 | 10009611140398 |
12 | 3a5b123500831 |
13 | 16377aa283853 |
14 | 875dda233737 |
15 | 3ed9035bd61d |
hex | 1f6b30d630a5 |
34545241305253 has 48 divisors (see below), whose sum is σ = 40781271921984. Its totient is φ = 29174171120640.
The previous prime is 34545241305241. The next prime is 34545241305259. The reversal of 34545241305253 is 35250314254543.
It is not a de Polignac number, because 34545241305253 - 25 = 34545241305221 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (34545241305259) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 4661343118 + ... + 4661350528.
It is an arithmetic number, because the mean of its divisors is an integer number (849609831708).
Almost surely, 234545241305253 is an apocalyptic number.
It is an amenable number.
34545241305253 is a deficient number, since it is larger than the sum of its proper divisors (6236030616731).
34545241305253 is a wasteful number, since it uses less digits than its factorization.
34545241305253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12242 (or 12235 counting only the distinct ones).
The product of its (nonzero) digits is 4320000, while the sum is 46.
Adding to 34545241305253 its reverse (35250314254543), we get a palindrome (69795555559796).
The spelling of 34545241305253 in words is "thirty-four trillion, five hundred forty-five billion, two hundred forty-one million, three hundred five thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •