Base | Representation |
---|---|
bin | 100011010110111010010000… |
… | …0011111110000111010111001 |
3 | 1111210012110100212022020112120 |
4 | 1012231310200133300322321 |
5 | 311231110100033044001 |
6 | 3021244540150431453 |
7 | 122336606406211341 |
oct | 10655644037607271 |
9 | 1453173325266476 |
10 | 311012012003001 |
11 | 901094a9789041 |
12 | 2aa70265662589 |
13 | 104703cb303b4a |
14 | 56b30c1431d21 |
15 | 25e520985a236 |
hex | 11add207f0eb9 |
311012012003001 has 8 divisors (see below), whose sum is σ = 420871976442144. Its totient is φ = 204246694449600.
The previous prime is 311012012002949. The next prime is 311012012003009. The reversal of 311012012003001 is 100300210210113.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 311012012003001 - 231 = 311009864519353 is a prime.
It is a super-2 number, since 2×3110120120030012 (a number of 30 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (311012012003009) 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, 773661721200 + ... + 773661721601.
It is an arithmetic number, because the mean of its divisors is an integer number (52608997055268).
Almost surely, 2311012012003001 is an apocalyptic number.
It is an amenable number.
311012012003001 is a deficient number, since it is larger than the sum of its proper divisors (109859964439143).
311012012003001 is a wasteful number, since it uses less digits than its factorization.
311012012003001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1547323442871.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 311012012003001 its reverse (100300210210113), we get a palindrome (411312222213114).
The spelling of 311012012003001 in words is "three hundred eleven trillion, twelve billion, twelve million, three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •