Base | Representation |
---|---|
bin | 110000010111001100010111… |
… | …1101110100011110100010111 |
3 | 2001210012212002120220202002000 |
4 | 1200232120233232203310113 |
5 | 421224223432133042403 |
6 | 4104430042245050343 |
7 | 155414100553440645 |
oct | 14056305756436427 |
9 | 2053185076822060 |
10 | 425400131534103 |
11 | 113600201102060 |
12 | 3b86548b3b69b3 |
13 | 1534a0a2568bbb |
14 | 7709694a90195 |
15 | 342a9789127a3 |
hex | 182e62fba3d17 |
425400131534103 has 64 divisors (see below), whose sum is σ = 708745815129600. Its totient is φ = 249976563022080.
The previous prime is 425400131534099. The next prime is 425400131534123. The reversal of 425400131534103 is 301435131004524.
425400131534103 is a `hidden beast` number, since 4 + 2 + 5 + 4 + 0 + 0 + 13 + 1 + 534 + 103 = 666.
It is not a de Polignac number, because 425400131534103 - 22 = 425400131534099 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (425400131534123) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 164999400 + ... + 167557757.
It is an arithmetic number, because the mean of its divisors is an integer number (11074153361400).
Almost surely, 2425400131534103 is an apocalyptic number.
425400131534103 is a deficient number, since it is larger than the sum of its proper divisors (283345683595497).
425400131534103 is a wasteful number, since it uses less digits than its factorization.
425400131534103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 332557309 (or 332557303 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 36.
Adding to 425400131534103 its reverse (301435131004524), we get a palindrome (726835262538627).
The spelling of 425400131534103 in words is "four hundred twenty-five trillion, four hundred billion, one hundred thirty-one million, five hundred thirty-four thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •