Base | Representation |
---|---|
bin | 1111011011110110001… |
… | …10101111101110000101 |
3 | 1212200220202012200022022 |
4 | 13231323012233232011 |
5 | 32142122130441201 |
6 | 1043345430412525 |
7 | 53213322352415 |
oct | 7557306575605 |
9 | 1780822180268 |
10 | 530346343301 |
11 | 194a11759365 |
12 | 8694bb01145 |
13 | 3b01c1b8828 |
14 | 1b951666645 |
15 | dbded7241b |
hex | 7b7b1afb85 |
530346343301 has 4 divisors (see below), whose sum is σ = 531709701900. Its totient is φ = 528982984704.
The previous prime is 530346343279. The next prime is 530346343337. The reversal of 530346343301 is 103343643035.
It is a happy number.
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 344821456225 + 185524887076 = 587215^2 + 430726^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-530346343301 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (530346343361) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 681678716 + ... + 681679493.
It is an arithmetic number, because the mean of its divisors is an integer number (132927425475).
Almost surely, 2530346343301 is an apocalyptic number.
It is an amenable number.
530346343301 is a deficient number, since it is larger than the sum of its proper divisors (1363358599).
530346343301 is a wasteful number, since it uses less digits than its factorization.
530346343301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1363358598.
The product of its (nonzero) digits is 116640, while the sum is 35.
Adding to 530346343301 its reverse (103343643035), we get a palindrome (633689986336).
The spelling of 530346343301 in words is "five hundred thirty billion, three hundred forty-six million, three hundred forty-three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •