Base | Representation |
---|---|
bin | 10000101001011011110… |
… | …00100110010011011001 |
3 | 2000200102200210011010211 |
4 | 20110231320212103121 |
5 | 33332424104241131 |
6 | 1114435015011121 |
7 | 56216463464011 |
oct | 10245570462331 |
9 | 2020380704124 |
10 | 572000462041 |
11 | 200647392288 |
12 | 92a35969aa1 |
13 | 41c29b71b78 |
14 | 1d9837b4c41 |
15 | ed2bb985b1 |
hex | 852de264d9 |
572000462041 has 4 divisors (see below), whose sum is σ = 572020456500. Its totient is φ = 571980467584.
The previous prime is 572000461979. The next prime is 572000462069. The reversal of 572000462041 is 140264000275.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 462915583641 + 109084878400 = 680379^2 + 330280^2 .
It is a cyclic number.
It is not a de Polignac number, because 572000462041 - 27 = 572000461913 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 572000461994 and 572000462012.
It is not an unprimeable number, because it can be changed into a prime (572000462441) 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 3 ways as a sum of consecutive naturals, for example, 9954256 + ... + 10011553.
It is an arithmetic number, because the mean of its divisors is an integer number (143005114125).
Almost surely, 2572000462041 is an apocalyptic number.
It is an amenable number.
572000462041 is a deficient number, since it is larger than the sum of its proper divisors (19994459).
572000462041 is a wasteful number, since it uses less digits than its factorization.
572000462041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19994458.
The product of its (nonzero) digits is 13440, while the sum is 31.
The spelling of 572000462041 in words is "five hundred seventy-two billion, four hundred sixty-two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •