Base | Representation |
---|---|
bin | 100011010111000010101100… |
… | …0011011010100111010110011 |
3 | 1111210021012010112221200122111 |
4 | 1012232011120123110322303 |
5 | 311231404201314424021 |
6 | 3021301134055150151 |
7 | 122341120401503350 |
oct | 10656053033247263 |
9 | 1453235115850574 |
10 | 311030130233011 |
11 | 90116156a83452 |
12 | 2aa73881375357 |
13 | 10472027b8b7c7 |
14 | 56b3d1d837627 |
15 | 25e591a2b98e1 |
hex | 11ae1586d4eb3 |
311030130233011 has 8 divisors (see below), whose sum is σ = 374171585242880. Its totient is φ = 252565820038728.
The previous prime is 311030130232967. The next prime is 311030130233059. The reversal of 311030130233011 is 110332031030113.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 311030130233011 - 29 = 311030130232499 is a prime.
It is a super-2 number, since 2×3110301302330112 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (311030130233311) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1169286203751 + ... + 1169286204016.
It is an arithmetic number, because the mean of its divisors is an integer number (46771448155360).
Almost surely, 2311030130233011 is an apocalyptic number.
311030130233011 is a deficient number, since it is larger than the sum of its proper divisors (63141455009869).
311030130233011 is a wasteful number, since it uses less digits than its factorization.
311030130233011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2338572407793.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 311030130233011 its reverse (110332031030113), we get a palindrome (421362161263124).
The spelling of 311030130233011 in words is "three hundred eleven trillion, thirty billion, one hundred thirty million, two hundred thirty-three thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •