Base | Representation |
---|---|
bin | 11101101011011110110001… |
… | …101000110010011010010100 |
3 | 122010011200011220200121021122 |
4 | 131223132301220302122110 |
5 | 114102111131311232322 |
6 | 1141341133224503112 |
7 | 36331402034530250 |
oct | 3553366150623224 |
9 | 563150156617248 |
10 | 130531331352212 |
11 | 3865603267033a |
12 | 12781a1a91aa98 |
13 | 57ab08985c60b |
14 | 2433a7058d260 |
15 | 1015645b3a442 |
hex | 76b7b1a32694 |
130531331352212 has 48 divisors (see below), whose sum is σ = 268213697998848. Its totient is φ = 54423889004640.
The previous prime is 130531331352091. The next prime is 130531331352299. The reversal of 130531331352212 is 212253133135031.
130531331352212 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 296750114 + ... + 297189657.
It is an arithmetic number, because the mean of its divisors is an integer number (5587785374976).
Almost surely, 2130531331352212 is an apocalyptic number.
It is an amenable number.
130531331352212 is an abundant number, since it is smaller than the sum of its proper divisors (137682366646636).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
130531331352212 is a wasteful number, since it uses less digits than its factorization.
130531331352212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 593939996 (or 593939994 counting only the distinct ones).
The product of its (nonzero) digits is 48600, while the sum is 35.
Adding to 130531331352212 its reverse (212253133135031), we get a palindrome (342784464487243).
The spelling of 130531331352212 in words is "one hundred thirty trillion, five hundred thirty-one billion, three hundred thirty-one million, three hundred fifty-two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •