Base | Representation |
---|---|
bin | 111100100101101101… |
… | …1000110001100010011 |
3 | 110102211220020001012121 |
4 | 1321023123012030103 |
5 | 4112433242211311 |
6 | 135435043235111 |
7 | 12254233156630 |
oct | 1711333061423 |
9 | 412756201177 |
10 | 130114413331 |
11 | 501aa215601 |
12 | 21273078a97 |
13 | c3677c3926 |
14 | 642476d187 |
15 | 35b7e13b71 |
hex | 1e4b6c6313 |
130114413331 has 16 divisors (see below), whose sum is σ = 152011238400. Its totient is φ = 109049388480.
The previous prime is 130114413287. The next prime is 130114413337. The reversal of 130114413331 is 133314411031.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130114413331 is a prime.
It is a super-2 number, since 2×1301144133312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 130114413296 and 130114413305.
It is not an unprimeable number, because it can be changed into a prime (130114413337) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 156616 + ... + 533626.
It is an arithmetic number, because the mean of its divisors is an integer number (9500702400).
Almost surely, 2130114413331 is an apocalyptic number.
130114413331 is a deficient number, since it is larger than the sum of its proper divisors (21896825069).
130114413331 is a wasteful number, since it uses less digits than its factorization.
130114413331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 378114.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 130114413331 its reverse (133314411031), we get a palindrome (263428824362).
The spelling of 130114413331 in words is "one hundred thirty billion, one hundred fourteen million, four hundred thirteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •