Base | Representation |
---|---|
bin | 11000010000110110000001… |
… | …11111000101000010111101 |
3 | 20222220201102002112120020121 |
4 | 30020123000333011002331 |
5 | 23443133144301342000 |
6 | 305251032450014541 |
7 | 14144536414615123 |
oct | 1410330077050275 |
9 | 228821362476217 |
10 | 53355321512125 |
11 | 16000957028a16 |
12 | 5b98751277451 |
13 | 23a0501470629 |
14 | d265a8a07913 |
15 | 627d636bbb1a |
hex | 3086c0fc50bd |
53355321512125 has 8 divisors (see below), whose sum is σ = 66587441247288. Its totient is φ = 42684257209600.
The previous prime is 53355321512123. The next prime is 53355321512167. The reversal of 53355321512125 is 52121512355335.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 54140164 + 53355267371961 = 7358^2 + 7304469^2 .
It is not a de Polignac number, because 53355321512125 - 21 = 53355321512123 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 (53355321512123) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 213421285924 + ... + 213421286173.
It is an arithmetic number, because the mean of its divisors is an integer number (8323430155911).
Almost surely, 253355321512125 is an apocalyptic number.
It is an amenable number.
53355321512125 is a deficient number, since it is larger than the sum of its proper divisors (13232119735163).
53355321512125 is an equidigital number, since it uses as much as digits as its factorization.
53355321512125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 426842572112 (or 426842572102 counting only the distinct ones).
The product of its digits is 675000, while the sum is 43.
The spelling of 53355321512125 in words is "fifty-three trillion, three hundred fifty-five billion, three hundred twenty-one million, five hundred twelve thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •