Base | Representation |
---|---|
bin | 11101100101110100100011… |
… | …100101010000001010110011 |
3 | 122001210111021200121211002220 |
4 | 131211310203211100022303 |
5 | 114024223114124113321 |
6 | 1140442332121412123 |
7 | 36261323006236161 |
oct | 3545644345201263 |
9 | 561714250554086 |
10 | 130142401004211 |
11 | 3851609a61a372 |
12 | 1271a57693a043 |
13 | 57804b66c4c1b |
14 | 241ccd662c231 |
15 | 100a480e8d9c6 |
hex | 765d239502b3 |
130142401004211 has 8 divisors (see below), whose sum is σ = 178213017591504. Its totient is φ = 84416692543200.
The previous prime is 130142401004197. The next prime is 130142401004221. The reversal of 130142401004211 is 112400104241031.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 130142401004211 - 210 = 130142401003187 is a prime.
It is not an unprimeable number, because it can be changed into a prime (130142401004221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 586227031440 + ... + 586227031661.
It is an arithmetic number, because the mean of its divisors is an integer number (22276627198938).
Almost surely, 2130142401004211 is an apocalyptic number.
130142401004211 is a deficient number, since it is larger than the sum of its proper divisors (48070616587293).
130142401004211 is a wasteful number, since it uses less digits than its factorization.
130142401004211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1172454063141.
The product of its (nonzero) digits is 768, while the sum is 24.
Adding to 130142401004211 its reverse (112400104241031), we get a palindrome (242542505245242).
The spelling of 130142401004211 in words is "one hundred thirty trillion, one hundred forty-two billion, four hundred one million, four thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •