Base | Representation |
---|---|
bin | 1101101111100011011011… |
… | …11111101111010110111101 |
3 | 10222000010021211222111001020 |
4 | 12313301231333233112331 |
5 | 12430121042220222003 |
6 | 144135235511534353 |
7 | 6236261245522665 |
oct | 667615577572675 |
9 | 128003254874036 |
10 | 30221235320253 |
11 | 96a18325216aa |
12 | 34810b268a3b9 |
13 | 13b2b09045c83 |
14 | 766a038391a5 |
15 | 3761cc67ed53 |
hex | 1b7c6dfef5bd |
30221235320253 has 4 divisors (see below), whose sum is σ = 40294980427008. Its totient is φ = 20147490213500.
The previous prime is 30221235320249. The next prime is 30221235320303. The reversal of 30221235320253 is 35202353212203.
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 30221235320253 - 22 = 30221235320249 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30221235320233) 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, 5036872553373 + ... + 5036872553378.
It is an arithmetic number, because the mean of its divisors is an integer number (10073745106752).
Almost surely, 230221235320253 is an apocalyptic number.
It is an amenable number.
30221235320253 is a deficient number, since it is larger than the sum of its proper divisors (10073745106755).
30221235320253 is a wasteful number, since it uses less digits than its factorization.
30221235320253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10073745106754.
The product of its (nonzero) digits is 64800, while the sum is 33.
Adding to 30221235320253 its reverse (35202353212203), we get a palindrome (65423588532456).
The spelling of 30221235320253 in words is "thirty trillion, two hundred twenty-one billion, two hundred thirty-five million, three hundred twenty thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •