Base | Representation |
---|---|
bin | 111100100011100001… |
… | …1001101110000110101 |
3 | 110102122210011111102202 |
4 | 1321013003031300311 |
5 | 4112311001402041 |
6 | 135423502514245 |
7 | 12252352431140 |
oct | 1710703156065 |
9 | 412583144382 |
10 | 130041044021 |
11 | 50171863109 |
12 | 21252595985 |
13 | c355545635 |
14 | 6418b11057 |
15 | 35b176ea9b |
hex | 1e470cdc35 |
130041044021 has 32 divisors (see below), whose sum is σ = 153080503296. Its totient is φ = 108148608000.
The previous prime is 130041044011. The next prime is 130041044033. The reversal of 130041044021 is 120440140031.
It is a cyclic number.
It is not a de Polignac number, because 130041044021 - 214 = 130041027637 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 130041043984 and 130041044002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130041044011) 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 31 ways as a sum of consecutive naturals, for example, 57009401 + ... + 57011681.
It is an arithmetic number, because the mean of its divisors is an integer number (4783765728).
Almost surely, 2130041044021 is an apocalyptic number.
It is an amenable number.
130041044021 is a deficient number, since it is larger than the sum of its proper divisors (23039459275).
130041044021 is a wasteful number, since it uses less digits than its factorization.
130041044021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3333.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 130041044021 its reverse (120440140031), we get a palindrome (250481184052).
It can be divided in two parts, 1300410 and 44021, that added together give a palindrome (1344431).
The spelling of 130041044021 in words is "one hundred thirty billion, forty-one million, forty-four thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •