Base | Representation |
---|---|
bin | 11000001100011101010011… |
… | …00011000000110100011011 |
3 | 20222101022101100202011122021 |
4 | 30012032221203000310123 |
5 | 23433201012213022301 |
6 | 305053505143435311 |
7 | 14130622460530255 |
oct | 1406165143006433 |
9 | 228338340664567 |
10 | 53204604423451 |
11 | 15a52a451794a8 |
12 | 5b734aa455b37 |
13 | 238c23247a860 |
14 | d1d18bd10cd5 |
15 | 623e91b918a1 |
hex | 3063a98c0d1b |
53204604423451 has 4 divisors (see below), whose sum is σ = 57297266302192. Its totient is φ = 49111942544712.
The previous prime is 53204604423403. The next prime is 53204604423479. The reversal of 53204604423451 is 15432440640235.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 53204604423451 - 215 = 53204604390683 is a prime.
It is a super-2 number, since 2×532046044234512 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 53204604423398 and 53204604423407.
It is not an unprimeable number, because it can be changed into a prime (53204604423401) 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, 2046330939351 + ... + 2046330939376.
It is an arithmetic number, because the mean of its divisors is an integer number (14324316575548).
Almost surely, 253204604423451 is an apocalyptic number.
53204604423451 is a deficient number, since it is larger than the sum of its proper divisors (4092661878741).
53204604423451 is a wasteful number, since it uses less digits than its factorization.
53204604423451 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4092661878740.
The product of its (nonzero) digits is 1382400, while the sum is 43.
The spelling of 53204604423451 in words is "fifty-three trillion, two hundred four billion, six hundred four million, four hundred twenty-three thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •