Base | Representation |
---|---|
bin | 111100100101111010… |
… | …1110000111011100101 |
3 | 110102212101101012210012 |
4 | 1321023311300323211 |
5 | 4112442034413013 |
6 | 135435453140005 |
7 | 12254346454160 |
oct | 1711365607345 |
9 | 412771335705 |
10 | 130121404133 |
11 | 5020315a926 |
12 | 2127548a605 |
13 | c3690a08b6 |
14 | 642566cad7 |
15 | 35b88451a8 |
hex | 1e4bd70ee5 |
130121404133 has 4 divisors (see below), whose sum is σ = 148710176160. Its totient is φ = 111532632108.
The previous prime is 130121404129. The next prime is 130121404151. The reversal of 130121404133 is 331404121031.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 130121404133 - 22 = 130121404129 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 130121404099 and 130121404108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130121406133) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9294386003 + ... + 9294386016.
It is an arithmetic number, because the mean of its divisors is an integer number (37177544040).
Almost surely, 2130121404133 is an apocalyptic number.
It is an amenable number.
130121404133 is a deficient number, since it is larger than the sum of its proper divisors (18588772027).
130121404133 is an equidigital number, since it uses as much as digits as its factorization.
130121404133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18588772026.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 130121404133 its reverse (331404121031), we get a palindrome (461525525164).
The spelling of 130121404133 in words is "one hundred thirty billion, one hundred twenty-one million, four hundred four thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •