Base | Representation |
---|---|
bin | 1111011011011000111… |
… | …11101110001100110001 |
3 | 1212200021122222202102000 |
4 | 13231230133232030301 |
5 | 32141121403414213 |
6 | 1043305233044213 |
7 | 53204255062443 |
oct | 7555437561461 |
9 | 1780248882360 |
10 | 530101232433 |
11 | 1948a63649a3 |
12 | 868a19b6669 |
13 | 3acb0498606 |
14 | 1b92aca0493 |
15 | dbc85a6c73 |
hex | 7b6c7ee331 |
530101232433 has 32 divisors (see below), whose sum is σ = 819539969280. Its totient is φ = 338010900480.
The previous prime is 530101232413. The next prime is 530101232443. The reversal of 530101232433 is 334232101035.
530101232433 is a `hidden beast` number, since 5 + 301 + 0 + 1 + 2 + 324 + 33 = 666.
It is not a de Polignac number, because 530101232433 - 225 = 530067678001 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 530101232397 and 530101232406.
It is not an unprimeable number, because it can be changed into a prime (530101232413) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 12618243 + ... + 12660183.
It is an arithmetic number, because the mean of its divisors is an integer number (25610624040).
Almost surely, 2530101232433 is an apocalyptic number.
It is an amenable number.
530101232433 is a deficient number, since it is larger than the sum of its proper divisors (289438736847).
530101232433 is a wasteful number, since it uses less digits than its factorization.
530101232433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 62326 (or 62320 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 27.
Adding to 530101232433 its reverse (334232101035), we get a palindrome (864333333468).
The spelling of 530101232433 in words is "five hundred thirty billion, one hundred one million, two hundred thirty-two thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •