Base | Representation |
---|---|
bin | 111100101000101000… |
… | …0001010101000001100 |
3 | 110110002201020200200100 |
4 | 1321101100022220030 |
5 | 4113133311224322 |
6 | 135452455331100 |
7 | 12256531350636 |
oct | 1712120125014 |
9 | 413081220610 |
10 | 130212211212 |
11 | 5024a4425a6 |
12 | 2129b980a90 |
13 | c381b45cb5 |
14 | 6433749a56 |
15 | 35c17d0dac |
hex | 1e5140aa0c |
130212211212 has 72 divisors (see below), whose sum is σ = 349749861552. Its totient is φ = 40705459200.
The previous prime is 130212211177. The next prime is 130212211223. The reversal of 130212211212 is 212112212031.
130212211212 is a `hidden beast` number, since 1 + 30 + 212 + 211 + 212 = 666.
It is a super-3 number, since 3×1302122112123 (a number of 34 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 206614 + ... + 550557.
It is an arithmetic number, because the mean of its divisors is an integer number (4857636966).
Almost surely, 2130212211212 is an apocalyptic number.
130212211212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
130212211212 is an abundant number, since it is smaller than the sum of its proper divisors (219537650340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130212211212 is a wasteful number, since it uses less digits than its factorization.
130212211212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 757479 (or 757474 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 130212211212 its reverse (212112212031), we get a palindrome (342324423243).
The spelling of 130212211212 in words is "one hundred thirty billion, two hundred twelve million, two hundred eleven thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •