Base | Representation |
---|---|
bin | 11101101000011011111010… |
… | …100010101110101011001111 |
3 | 122002102200010022001200122211 |
4 | 131220123322202232223033 |
5 | 114040144130340301221 |
6 | 1141101051410251251 |
7 | 36310314104001505 |
oct | 3550337242565317 |
9 | 562380108050584 |
10 | 130322101103311 |
11 | 38585324645567 |
12 | 12749367b86b27 |
13 | 5794424174800 |
14 | 24278a267c675 |
15 | 100ee9c1a76e1 |
hex | 7686fa8aeacf |
130322101103311 has 24 divisors (see below), whose sum is σ = 145600627481280. Its totient is φ = 116533542842496.
The previous prime is 130322101103309. The next prime is 130322101103347. The reversal of 130322101103311 is 113301101223031.
It is not a de Polignac number, because 130322101103311 - 21 = 130322101103309 is a prime.
It is a super-2 number, since 2×1303221011033112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130322101100311) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 91379416 + ... + 92794621.
It is an arithmetic number, because the mean of its divisors is an integer number (6066692811720).
Almost surely, 2130322101103311 is an apocalyptic number.
130322101103311 is a deficient number, since it is larger than the sum of its proper divisors (15278526377969).
130322101103311 is a wasteful number, since it uses less digits than its factorization.
130322101103311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 184174195 (or 184174182 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 130322101103311 its reverse (113301101223031), we get a palindrome (243623202326342).
The spelling of 130322101103311 in words is "one hundred thirty trillion, three hundred twenty-two billion, one hundred one million, one hundred three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •