Base | Representation |
---|---|
bin | 111100101000111001… |
… | …0011111101001110111 |
3 | 110110010100011220000100 |
4 | 1321101302133221313 |
5 | 4113143112211411 |
6 | 135453420245143 |
7 | 12260001011100 |
oct | 1712162375167 |
9 | 413110156010 |
10 | 130221210231 |
11 | 50254529702 |
12 | 212a29a07b3 |
13 | c383977068 |
14 | 6434a0d3a7 |
15 | 35c24ac456 |
hex | 1e51c9fa77 |
130221210231 has 72 divisors (see below), whose sum is σ = 227052453888. Its totient is φ = 71633268000.
The previous prime is 130221210193. The next prime is 130221210311. The reversal of 130221210231 is 132012122031.
130221210231 is a `hidden beast` number, since 1 + 3 + 0 + 221 + 210 + 231 = 666.
It is not a de Polignac number, because 130221210231 - 214 = 130221193847 is a prime.
It is a super-2 number, since 2×1302212102312 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130221210331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 2586226 + ... + 2636096.
It is an arithmetic number, because the mean of its divisors is an integer number (3153506304).
Almost surely, 2130221210231 is an apocalyptic number.
130221210231 is a deficient number, since it is larger than the sum of its proper divisors (96831243657).
130221210231 is a wasteful number, since it uses less digits than its factorization.
130221210231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50113 (or 50103 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 130221210231 its reverse (132012122031), we get a palindrome (262233332262).
The spelling of 130221210231 in words is "one hundred thirty billion, two hundred twenty-one million, two hundred ten thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.440 sec. • engine limits •