Base | Representation |
---|---|
bin | 1111011011110100101… |
… | …00000011100000111001 |
3 | 1212200212211012120020020 |
4 | 13231322110003200321 |
5 | 32142110230230113 |
6 | 1043344233521053 |
7 | 53213101406205 |
oct | 7557224034071 |
9 | 1780784176206 |
10 | 530333055033 |
11 | 194a05202721 |
12 | 86947573189 |
13 | 3b019515352 |
14 | 1b94d9a7b05 |
15 | dbddaea023 |
hex | 7b7a503839 |
530333055033 has 8 divisors (see below), whose sum is σ = 707202830496. Its totient is φ = 353509324800.
The previous prime is 530333055017. The next prime is 530333055053. The reversal of 530333055033 is 330550333035.
It is a happy number.
530333055033 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 530333055033 - 24 = 530333055017 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 530333054985 and 530333055003.
It is not an unprimeable number, because it can be changed into a prime (530333055053) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11484423 + ... + 11530508.
It is an arithmetic number, because the mean of its divisors is an integer number (88400353812).
Almost surely, 2530333055033 is an apocalyptic number.
It is an amenable number.
530333055033 is a deficient number, since it is larger than the sum of its proper divisors (176869775463).
530333055033 is a wasteful number, since it uses less digits than its factorization.
530333055033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23022615.
The product of its (nonzero) digits is 91125, while the sum is 33.
Adding to 530333055033 its reverse (330550333035), we get a palindrome (860883388068).
The spelling of 530333055033 in words is "five hundred thirty billion, three hundred thirty-three million, fifty-five thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •