Base | Representation |
---|---|
bin | 111000010110011100… |
… | …0001011110010010010 |
3 | 102120100112110001102010 |
4 | 1300230320023302102 |
5 | 3440313033311010 |
6 | 131331523203350 |
7 | 11512535054154 |
oct | 1605470136222 |
9 | 376315401363 |
10 | 121012010130 |
11 | 47359141330 |
12 | 1b552816556 |
13 | b546a6b02b |
14 | 5bdd8dcad4 |
15 | 3233c5a620 |
hex | 1c2ce0bc92 |
121012010130 has 64 divisors (see below), whose sum is σ = 327051841536. Its totient is φ = 28389912000.
The previous prime is 121012010117. The next prime is 121012010143. The reversal of 121012010130 is 31010210121.
It is an interprime number because it is at equal distance from previous prime (121012010117) and next prime (121012010143).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5904336 + ... + 5924795.
It is an arithmetic number, because the mean of its divisors is an integer number (5110185024).
Almost surely, 2121012010130 is an apocalyptic number.
121012010130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
121012010130 is an abundant number, since it is smaller than the sum of its proper divisors (206039831406).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121012010130 is a wasteful number, since it uses less digits than its factorization.
121012010130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11829183.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 121012010130 its reverse (31010210121), we get a palindrome (152022220251).
Subtracting from 121012010130 its reverse (31010210121), we obtain a square (90001800009 = 3000032).
The spelling of 121012010130 in words is "one hundred twenty-one billion, twelve million, ten thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •