Base | Representation |
---|---|
bin | 100011011000010111111010… |
… | …0001001000111001000110110 |
3 | 1111210220200111012210122011021 |
4 | 1012300233310021013020312 |
5 | 311242403443110030402 |
6 | 3021521201103531354 |
7 | 122360256341245561 |
oct | 10660576411071066 |
9 | 1453820435718137 |
10 | 311213131330102 |
11 | 90186825365261 |
12 | 2aaa3233bb9b5a |
13 | 104863704aca41 |
14 | 56bcb200434d8 |
15 | 25ea57b1d1d37 |
hex | 11b0bf4247236 |
311213131330102 has 64 divisors (see below), whose sum is σ = 502557252120000. Its totient is φ = 144109766338560.
The previous prime is 311213131330093. The next prime is 311213131330111. The reversal of 311213131330102 is 201033131312113.
It is an interprime number because it is at equal distance from previous prime (311213131330093) and next prime (311213131330111).
It is a super-2 number, since 2×3112131313301022 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 169026474 + ... + 170857762.
It is an arithmetic number, because the mean of its divisors is an integer number (7852457064375).
Almost surely, 2311213131330102 is an apocalyptic number.
311213131330102 is a deficient number, since it is larger than the sum of its proper divisors (191344120789898).
311213131330102 is a wasteful number, since it uses less digits than its factorization.
311213131330102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1831969.
The product of its (nonzero) digits is 972, while the sum is 25.
Adding to 311213131330102 its reverse (201033131312113), we get a palindrome (512246262642215).
The spelling of 311213131330102 in words is "three hundred eleven trillion, two hundred thirteen billion, one hundred thirty-one million, three hundred thirty thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •