Base | Representation |
---|---|
bin | 111100010101001010101011… |
… | …1000010110101011111100111 |
3 | 2120120222000020200101010002121 |
4 | 1320222111113002311133213 |
5 | 1024024033324021144223 |
6 | 5120352335120050411 |
7 | 216530661425540362 |
oct | 17052252702653747 |
9 | 2516860220333077 |
10 | 530674734553063 |
11 | 1440a8988aa2261 |
12 | 4b62839aa63a07 |
13 | 19a15549a46069 |
14 | 9508b193c70d9 |
15 | 415410362615d |
hex | 1e2a5570b57e7 |
530674734553063 has 8 divisors (see below), whose sum is σ = 533437995774848. Its totient is φ = 527911614065664.
The previous prime is 530674734553043. The next prime is 530674734553123. The reversal of 530674734553063 is 360355437476035.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-530674734553063 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 530674734552992 and 530674734553010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (530674734553043) 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, 27618231 + ... + 42709672.
It is an arithmetic number, because the mean of its divisors is an integer number (66679749471856).
Almost surely, 2530674734553063 is an apocalyptic number.
530674734553063 is a deficient number, since it is larger than the sum of its proper divisors (2763261221785).
530674734553063 is a wasteful number, since it uses less digits than its factorization.
530674734553063 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 70367193.
The product of its (nonzero) digits is 285768000, while the sum is 61.
The spelling of 530674734553063 in words is "five hundred thirty trillion, six hundred seventy-four billion, seven hundred thirty-four million, five hundred fifty-three thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •