Base | Representation |
---|---|
bin | 1101110010011101101010… |
… | …00001001001110101110101 |
3 | 10222100200100100002101011210 |
4 | 12321032311001021311311 |
5 | 12433240320021333023 |
6 | 144253212212152033 |
7 | 6246430610022531 |
oct | 671166501116565 |
9 | 128320310071153 |
10 | 30321211121013 |
11 | 973017622952a |
12 | 3498554308619 |
13 | 13bc37c831b27 |
14 | 76b7a959abc1 |
15 | 378ace6d9593 |
hex | 1b93b5049d75 |
30321211121013 has 4 divisors (see below), whose sum is σ = 40428281494688. Its totient is φ = 20214140747340.
The previous prime is 30321211120951. The next prime is 30321211121093. The reversal of 30321211121013 is 31012111212303.
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 not a de Polignac number, because 30321211121013 - 213 = 30321211112821 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30321211121093) 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, 5053535186833 + ... + 5053535186838.
It is an arithmetic number, because the mean of its divisors is an integer number (10107070373672).
Almost surely, 230321211121013 is an apocalyptic number.
It is an amenable number.
30321211121013 is a deficient number, since it is larger than the sum of its proper divisors (10107070373675).
30321211121013 is a wasteful number, since it uses less digits than its factorization.
30321211121013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10107070373674.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 30321211121013 its reverse (31012111212303), we get a palindrome (61333322333316).
The spelling of 30321211121013 in words is "thirty trillion, three hundred twenty-one billion, two hundred eleven million, one hundred twenty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •