Base | Representation |
---|---|
bin | 1010100001100010100… |
… | …10101000010010010101 |
3 | 1021120100211010122200212 |
4 | 11100301102220102111 |
5 | 21411031140020203 |
6 | 434041345215205 |
7 | 35060614104416 |
oct | 5206122502225 |
9 | 1246324118625 |
10 | 361604220053 |
11 | 12a3a017865a |
12 | 5a0b8631505 |
13 | 28139a3b61b |
14 | 13704aa780d |
15 | 9615b961d8 |
hex | 54314a8495 |
361604220053 has 4 divisors (see below), whose sum is σ = 377326142688. Its totient is φ = 345882297420.
The previous prime is 361604219881. The next prime is 361604220059. The reversal of 361604220053 is 350022406163.
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, and also an emirpimes, since its reverse is a distinct semiprime: 350022406163 = 95287 ⋅3673349.
It is a cyclic number.
It is not a de Polignac number, because 361604220053 - 218 = 361603957909 is a prime.
It is a super-2 number, since 2×3616042200532 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (361604220059) 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, 7860961283 + ... + 7860961328.
It is an arithmetic number, because the mean of its divisors is an integer number (94331535672).
Almost surely, 2361604220053 is an apocalyptic number.
It is an amenable number.
361604220053 is a deficient number, since it is larger than the sum of its proper divisors (15721922635).
361604220053 is a wasteful number, since it uses less digits than its factorization.
361604220053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15721922634.
The product of its (nonzero) digits is 25920, while the sum is 32.
The spelling of 361604220053 in words is "three hundred sixty-one billion, six hundred four million, two hundred twenty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •