Base | Representation |
---|---|
bin | 100010010010101… |
… | …101110100111010 |
3 | 1111002120212122100 |
4 | 202102231310322 |
5 | 2134241103032 |
6 | 133031204230 |
7 | 20154144504 |
oct | 4222556472 |
9 | 1432525570 |
10 | 575331642 |
11 | 27583a1a6 |
12 | 140816676 |
13 | 9226c632 |
14 | 565a4d74 |
15 | 3579897c |
hex | 224add3a |
575331642 has 48 divisors (see below), whose sum is σ = 1275157728. Its totient is φ = 187405920.
The previous prime is 575331623. The next prime is 575331643. The reversal of 575331642 is 246133575.
575331642 is a `hidden beast` number, since 5 + 7 + 5 + 3 + 3 + 1 + 642 = 666.
575331642 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 575331597 and 575331606.
It is not an unprimeable number, because it can be changed into a prime (575331643) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 268917 + ... + 271047.
It is an arithmetic number, because the mean of its divisors is an integer number (26565786).
Almost surely, 2575331642 is an apocalyptic number.
575331642 is an abundant number, since it is smaller than the sum of its proper divisors (699826086).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
575331642 is a wasteful number, since it uses less digits than its factorization.
575331642 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2475 (or 2472 counting only the distinct ones).
The product of its digits is 75600, while the sum is 36.
The square root of 575331642 is about 23986.0718334620. The cubic root of 575331642 is about 831.7115897000.
The spelling of 575331642 in words is "five hundred seventy-five million, three hundred thirty-one thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •