Base | Representation |
---|---|
bin | 11101100101001110010001… |
… | …111101101001101110001100 |
3 | 122001122120012111220010022212 |
4 | 131211032101331221232030 |
5 | 114023034432111034012 |
6 | 1140411414045325552 |
7 | 36255336401654465 |
oct | 3545162175515614 |
9 | 561576174803285 |
10 | 130101303221132 |
11 | 384aa71aa30691 |
12 | 127126072668b8 |
13 | 5779667089a99 |
14 | 241ad1833bd6c |
15 | 1009377e0cb22 |
hex | 765391f69b8c |
130101303221132 has 48 divisors (see below), whose sum is σ = 230802665049600. Its totient is φ = 64159437925440.
The previous prime is 130101303221101. The next prime is 130101303221159. The reversal of 130101303221132 is 231122303101031.
It is a super-2 number, since 2×1301013032211322 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 130101303221098 and 130101303221107.
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, 3679005683 + ... + 3679041045.
It is an arithmetic number, because the mean of its divisors is an integer number (4808388855200).
Almost surely, 2130101303221132 is an apocalyptic number.
It is an amenable number.
130101303221132 is a deficient number, since it is larger than the sum of its proper divisors (100701361828468).
130101303221132 is a wasteful number, since it uses less digits than its factorization.
130101303221132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47406 (or 47404 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 130101303221132 its reverse (231122303101031), we get a palindrome (361223606322163).
The spelling of 130101303221132 in words is "one hundred thirty trillion, one hundred one billion, three hundred three million, two hundred twenty-one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •