Base | Representation |
---|---|
bin | 111100101100001111… |
… | …0001111000111100011 |
3 | 110110102011011200022121 |
4 | 1321120132033013203 |
5 | 4113410313341011 |
6 | 135512503445111 |
7 | 12262532053321 |
oct | 1713036170743 |
9 | 413364150277 |
10 | 130333340131 |
11 | 50301855545 |
12 | 21314456797 |
13 | c3a0c76a07 |
14 | 644587ad11 |
15 | 35cc25ae71 |
hex | 1e5878f1e3 |
130333340131 has 4 divisors (see below), whose sum is σ = 131270990200. Its totient is φ = 129395690064.
The previous prime is 130333340089. The next prime is 130333340143. The reversal of 130333340131 is 131043333031.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 130333340131 - 229 = 129796469219 is a prime.
It is a super-2 number, since 2×1303333401312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130333340096 and 130333340105.
It is not an unprimeable number, because it can be changed into a prime (130333340191) 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, 468824826 + ... + 468825103.
It is an arithmetic number, because the mean of its divisors is an integer number (32817747550).
Almost surely, 2130333340131 is an apocalyptic number.
130333340131 is a deficient number, since it is larger than the sum of its proper divisors (937650069).
130333340131 is an equidigital number, since it uses as much as digits as its factorization.
130333340131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 937650068.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 130333340131 its reverse (131043333031), we get a palindrome (261376673162).
The spelling of 130333340131 in words is "one hundred thirty billion, three hundred thirty-three million, three hundred forty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •