Base | Representation |
---|---|
bin | 111100010000101010001010… |
… | …1001100001000100000000011 |
3 | 2120111202210000002000101122120 |
4 | 1320201110111030020200003 |
5 | 1023433410424011401311 |
6 | 5115155550515135323 |
7 | 216435135566263614 |
oct | 17041242514104003 |
9 | 2514683002011576 |
10 | 530055154403331 |
11 | 14398a146173437 |
12 | 4b5482a68a4543 |
13 | 1999bca96b274b |
14 | 94c6b4090bc0b |
15 | 4142e3e822706 |
hex | 1e21515308803 |
530055154403331 has 8 divisors (see below), whose sum is σ = 706998990285504. Its totient is φ = 353240710728360.
The previous prime is 530055154403267. The next prime is 530055154403339. The reversal of 530055154403331 is 133304451550035.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 530055154403331 - 26 = 530055154403267 is a prime.
It is a super-2 number, since 2×5300551544033312 (a number of 30 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (530055154403339) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 32348042241 + ... + 32348058626.
It is an arithmetic number, because the mean of its divisors is an integer number (88374873785688).
Almost surely, 2530055154403331 is an apocalyptic number.
530055154403331 is a deficient number, since it is larger than the sum of its proper divisors (176943835882173).
530055154403331 is a wasteful number, since it uses less digits than its factorization.
530055154403331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64696103601.
The product of its (nonzero) digits is 810000, while the sum is 42.
The spelling of 530055154403331 in words is "five hundred thirty trillion, fifty-five billion, one hundred fifty-four million, four hundred three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •