Base | Representation |
---|---|
bin | 1011111110011000110… |
… | …0011000101100100001 |
3 | 201200000100202200002100 |
4 | 2333212030120230201 |
5 | 11332311210010343 |
6 | 234301534441013 |
7 | 20602032431556 |
oct | 2774614305441 |
9 | 650010680070 |
10 | 205725469473 |
11 | 7a27a734157 |
12 | 33a55063169 |
13 | 16527566c34 |
14 | 9d5866aa2d |
15 | 5540e2e9d3 |
hex | 2fe6318b21 |
205725469473 has 24 divisors (see below), whose sum is σ = 300772180800. Its totient is φ = 135489842784.
The previous prime is 205725469463. The next prime is 205725469571. The reversal of 205725469473 is 374964527502.
205725469473 is a `hidden beast` number, since 2 + 0 + 5 + 7 + 2 + 546 + 94 + 7 + 3 = 666.
205725469473 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 205725469473 - 28 = 205725469217 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (205725469403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 48183 + ... + 643251.
It is an arithmetic number, because the mean of its divisors is an integer number (12532174200).
Almost surely, 2205725469473 is an apocalyptic number.
It is an amenable number.
205725469473 is a deficient number, since it is larger than the sum of its proper divisors (95046711327).
205725469473 is a wasteful number, since it uses less digits than its factorization.
205725469473 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 595541 (or 595538 counting only the distinct ones).
The product of its (nonzero) digits is 12700800, while the sum is 54.
The spelling of 205725469473 in words is "two hundred five billion, seven hundred twenty-five million, four hundred sixty-nine thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •