Base | Representation |
---|---|
bin | 101100000101111011111… |
… | …100001010010101100111 |
3 | 101201200001002111000010111 |
4 | 230011323330022111213 |
5 | 344121001003442411 |
6 | 10235551022433451 |
7 | 431625000125200 |
oct | 54057374122547 |
9 | 11650032430114 |
10 | 3030031312231 |
11 | a69035757090 |
12 | 40b2a7432887 |
13 | 18c966539341 |
14 | a69235725a7 |
15 | 53c40ea5721 |
hex | 2c17bf0a567 |
3030031312231 has 48 divisors (see below), whose sum is σ = 3880957860000. Its totient is φ = 2339164343040.
The previous prime is 3030031312169. The next prime is 3030031312283. The reversal of 3030031312231 is 1322131300303.
It is not a de Polignac number, because 3030031312231 - 221 = 3030029215079 is a prime.
It is a super-2 number, since 2×30300313122312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3030031312291) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 31192485 + ... + 31289473.
It is an arithmetic number, because the mean of its divisors is an integer number (80853288750).
Almost surely, 23030031312231 is an apocalyptic number.
3030031312231 is a deficient number, since it is larger than the sum of its proper divisors (850926547769).
3030031312231 is a wasteful number, since it uses less digits than its factorization.
3030031312231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97552 (or 97545 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 3030031312231 its reverse (1322131300303), we get a palindrome (4352162612534).
The spelling of 3030031312231 in words is "three trillion, thirty billion, thirty-one million, three hundred twelve thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •