Base | Representation |
---|---|
bin | 1110000011111100000100… |
… | …01010110100110100110001 |
3 | 11001111002012012020112222001 |
4 | 13001332002022310310301 |
5 | 13023110021240033133 |
6 | 145433113403014001 |
7 | 6341005253355634 |
oct | 701760212646461 |
9 | 131432165215861 |
10 | 30921653439793 |
11 | 9941888271736 |
12 | 35749a720a301 |
13 | 1433b8ccc9a0c |
14 | 78c88a49dc1b |
15 | 3895232c987d |
hex | 1c1f822b4d31 |
30921653439793 has 16 divisors (see below), whose sum is σ = 32394455044560. Its totient is φ = 29477416550400.
The previous prime is 30921653439791. The next prime is 30921653439797. The reversal of 30921653439793 is 39793435612903.
It can be written as a sum of positive squares in 8 ways, for example, as 10430522855424 + 20491130584369 = 3229632^2 + 4526713^2 .
It is a cyclic number.
It is not a de Polignac number, because 30921653439793 - 21 = 30921653439791 is a prime.
It is a super-2 number, since 2×309216534397932 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30921653439791) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11870848 + ... + 14239393.
It is an arithmetic number, because the mean of its divisors is an integer number (2024653440285).
Almost surely, 230921653439793 is an apocalyptic number.
It is an amenable number.
30921653439793 is a deficient number, since it is larger than the sum of its proper divisors (1472801604767).
30921653439793 is a wasteful number, since it uses less digits than its factorization.
30921653439793 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26110788.
The product of its (nonzero) digits is 99202320, while the sum is 64.
The spelling of 30921653439793 in words is "thirty trillion, nine hundred twenty-one billion, six hundred fifty-three million, four hundred thirty-nine thousand, seven hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •