Base | Representation |
---|---|
bin | 11101110111000110100111… |
… | …111110001101100000001100 |
3 | 122020000000202210221222000012 |
4 | 131313012213332031200030 |
5 | 114203202401434104400 |
6 | 1143152103451252352 |
7 | 36443165435504513 |
oct | 3567064776154014 |
9 | 566000683858005 |
10 | 131330033113100 |
11 | 38933832a1a848 |
12 | 1289078244a0b8 |
13 | 58384a4869663 |
14 | 246059c33167a |
15 | 102b2dee88d35 |
hex | 7771a7f8d80c |
131330033113100 has 36 divisors (see below), whose sum is σ = 297376874984784. Its totient is φ = 50248012668480.
The previous prime is 131330033113093. The next prime is 131330033113117. The reversal of 131330033113100 is 1311330033131.
It is a super-2 number, since 2×1313300331131002 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 28550004899 + ... + 28550009498.
Almost surely, 2131330033113100 is an apocalyptic number.
131330033113100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
131330033113100 is an abundant number, since it is smaller than the sum of its proper divisors (166046841871684).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
131330033113100 is a wasteful number, since it uses less digits than its factorization.
131330033113100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 57100014434 (or 57100014427 counting only the distinct ones).
The product of its (nonzero) digits is 729, while the sum is 23.
Adding to 131330033113100 its reverse (1311330033131), we get a palindrome (132641363146231).
The spelling of 131330033113100 in words is "one hundred thirty-one trillion, three hundred thirty billion, thirty-three million, one hundred thirteen thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.977 sec. • engine limits •