Base | Representation |
---|---|
bin | 1101111001010010001011… |
… | …01010111010111111111001 |
3 | 11000012002020221120002022222 |
4 | 12330221011222322333321 |
5 | 13001110244423121403 |
6 | 144553011111253425 |
7 | 6302365262360003 |
oct | 674510552727771 |
9 | 130162227502288 |
10 | 30555566223353 |
11 | 98105a7607596 |
12 | 3515a5937a275 |
13 | 14084ba589212 |
14 | 778c7c275373 |
15 | 37ec48ca3338 |
hex | 1bca45abaff9 |
30555566223353 has 4 divisors (see below), whose sum is σ = 30852222206208. Its totient is φ = 30258910240500.
The previous prime is 30555566223263. The next prime is 30555566223379. The reversal of 30555566223353 is 35332266555503.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 30555566223353 - 28 = 30555566223097 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 30555566223295 and 30555566223304.
It is not an unprimeable number, because it can be changed into a prime (30555566223053) 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, 148327991273 + ... + 148327991478.
It is an arithmetic number, because the mean of its divisors is an integer number (7713055551552).
Almost surely, 230555566223353 is an apocalyptic number.
It is an amenable number.
30555566223353 is a deficient number, since it is larger than the sum of its proper divisors (296655982855).
30555566223353 is a wasteful number, since it uses less digits than its factorization.
30555566223353 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 296655982854.
The product of its (nonzero) digits is 36450000, while the sum is 53.
The spelling of 30555566223353 in words is "thirty trillion, five hundred fifty-five billion, five hundred sixty-six million, two hundred twenty-three thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •