Base | Representation |
---|---|
bin | 111100100101111100… |
… | …0100010011001011001 |
3 | 110102212102202010220102 |
4 | 1321023320202121121 |
5 | 4112442231143113 |
6 | 135435520505145 |
7 | 12254355602336 |
oct | 1711370423131 |
9 | 412772663812 |
10 | 130122131033 |
11 | 50203606a74 |
12 | 2127577b1b5 |
13 | c36929670b |
14 | 64257bb98d |
15 | 35b893a758 |
hex | 1e4be22659 |
130122131033 has 8 divisors (see below), whose sum is σ = 133325347680. Its totient is φ = 126920319520.
The previous prime is 130122131023. The next prime is 130122131039. The reversal of 130122131033 is 330131221031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 130122131033 - 28 = 130122130777 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130122130996 and 130122131014.
It is not an unprimeable number, because it can be changed into a prime (130122131039) 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 7 ways as a sum of consecutive naturals, for example, 162563 + ... + 535416.
It is an arithmetic number, because the mean of its divisors is an integer number (16665668460).
Almost surely, 2130122131033 is an apocalyptic number.
It is an amenable number.
130122131033 is a deficient number, since it is larger than the sum of its proper divisors (3203216647).
130122131033 is an equidigital number, since it uses as much as digits as its factorization.
130122131033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 702567.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 130122131033 its reverse (330131221031), we get a palindrome (460253352064).
The spelling of 130122131033 in words is "one hundred thirty billion, one hundred twenty-two million, one hundred thirty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •