Base | Representation |
---|---|
bin | 11101100110111000011000… |
… | …000100100000000010111111 |
3 | 122002001110020201202121021012 |
4 | 131212320120010200002333 |
5 | 114031421233403010101 |
6 | 1140540014115025435 |
7 | 36266511412164263 |
oct | 3546703004400277 |
9 | 562043221677235 |
10 | 130215222313151 |
11 | 38543a69323618 |
12 | 127306ba59b27b |
13 | 57873204ba941 |
14 | 2422643c140a3 |
15 | 100c2e40e7bbb |
hex | 766e181200bf |
130215222313151 has 2 divisors, whose sum is σ = 130215222313152. Its totient is φ = 130215222313150.
The previous prime is 130215222313133. The next prime is 130215222313199. The reversal of 130215222313151 is 151313222512031.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 130215222313151 - 222 = 130215218118847 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130215222513151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65107611156575 + 65107611156576.
It is an arithmetic number, because the mean of its divisors is an integer number (65107611156576).
Almost surely, 2130215222313151 is an apocalyptic number.
130215222313151 is a deficient number, since it is larger than the sum of its proper divisors (1).
130215222313151 is an equidigital number, since it uses as much as digits as its factorization.
130215222313151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10800, while the sum is 32.
Adding to 130215222313151 its reverse (151313222512031), we get a palindrome (281528444825182).
The spelling of 130215222313151 in words is "one hundred thirty trillion, two hundred fifteen billion, two hundred twenty-two million, three hundred thirteen thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •