Base | Representation |
---|---|
bin | 11101100101010111011001… |
… | …111101101000111110010100 |
3 | 122001200111111100100120010200 |
4 | 131211113121331220332110 |
5 | 114023220013341042322 |
6 | 1140420114212220500 |
7 | 36256134243446553 |
oct | 3545273175507624 |
9 | 561614440316120 |
10 | 130111101112212 |
11 | 38503898652230 |
12 | 127144a060a730 |
13 | 577a568c3207c |
14 | 241b5a76cdd9a |
15 | 100974d1968ac |
hex | 7655d9f68f94 |
130111101112212 has 144 divisors (see below), whose sum is σ = 374529072188544. Its totient is φ = 37733109984000.
The previous prime is 130111101112189. The next prime is 130111101112277. The reversal of 130111101112212 is 212211101111031.
130111101112212 is a `hidden beast` number, since 130 + 111 + 101 + 112 + 212 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 71893864 + ... + 73681407.
Almost surely, 2130111101112212 is an apocalyptic number.
130111101112212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
130111101112212 is an abundant number, since it is smaller than the sum of its proper divisors (244417971076332).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130111101112212 is a wasteful number, since it uses less digits than its factorization.
130111101112212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 145575390 (or 145575385 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 18.
Adding to 130111101112212 its reverse (212211101111031), we get a palindrome (342322202223243).
The spelling of 130111101112212 in words is "one hundred thirty trillion, one hundred eleven billion, one hundred one million, one hundred twelve thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •