Base | Representation |
---|---|
bin | 11101100110111110111000… |
… | …101000101110111101111111 |
3 | 122002002010021210110110012022 |
4 | 131212332320220232331333 |
5 | 114032030042022231221 |
6 | 1140543131413430355 |
7 | 36300146534161253 |
oct | 3546767050567577 |
9 | 562063253413168 |
10 | 130222211133311 |
11 | 38546a25331650 |
12 | 12731b2b03b3bb |
13 | 5787b953aac9b |
14 | 2422b080a0263 |
15 | 100c5a29544ab |
hex | 766fb8a2ef7f |
130222211133311 has 16 divisors (see below), whose sum is σ = 143870325258240. Its totient is φ = 116875958390880.
The previous prime is 130222211133307. The next prime is 130222211133367. The reversal of 130222211133311 is 113331112222031.
It is a cyclic number.
It is not a de Polignac number, because 130222211133311 - 22 = 130222211133307 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130222211163311) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4904765 + ... + 16867161.
It is an arithmetic number, because the mean of its divisors is an integer number (8991895328640).
Almost surely, 2130222211133311 is an apocalyptic number.
130222211133311 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
130222211133311 is a deficient number, since it is larger than the sum of its proper divisors (13648114124929).
130222211133311 is a wasteful number, since it uses less digits than its factorization.
130222211133311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11975014.
The product of its (nonzero) digits is 1296, while the sum is 26.
Adding to 130222211133311 its reverse (113331112222031), we get a palindrome (243553323355342).
The spelling of 130222211133311 in words is "one hundred thirty trillion, two hundred twenty-two billion, two hundred eleven million, one hundred thirty-three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •