Base | Representation |
---|---|
bin | 10010110000011001010001… |
… | …10101111001110011111001 |
3 | 12102001000012211002101022120 |
4 | 21120030220311321303321 |
5 | 20401230241034200203 |
6 | 223415450433311453 |
7 | 11454604616554452 |
oct | 1130145065716371 |
9 | 172030184071276 |
10 | 41245256162553 |
11 | 121620189299a3 |
12 | 4761734a05589 |
13 | 1a02545b82c81 |
14 | a283d12b4129 |
15 | 4b7d3ca95b53 |
hex | 258328d79cf9 |
41245256162553 has 4 divisors (see below), whose sum is σ = 54993674883408. Its totient is φ = 27496837441700.
The previous prime is 41245256162479. The next prime is 41245256162573. The reversal of 41245256162553 is 35526165254214.
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 41245256162553 - 29 = 41245256162041 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 41245256162496 and 41245256162505.
It is not an unprimeable number, because it can be changed into a prime (41245256162573) 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, 6874209360423 + ... + 6874209360428.
It is an arithmetic number, because the mean of its divisors is an integer number (13748418720852).
Almost surely, 241245256162553 is an apocalyptic number.
It is an amenable number.
41245256162553 is a deficient number, since it is larger than the sum of its proper divisors (13748418720855).
41245256162553 is a wasteful number, since it uses less digits than its factorization.
41245256162553 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13748418720854.
The product of its digits is 8640000, while the sum is 51.
The spelling of 41245256162553 in words is "forty-one trillion, two hundred forty-five billion, two hundred fifty-six million, one hundred sixty-two thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •