Base | Representation |
---|---|
bin | 111100101000010011… |
… | …0001010111010011011 |
3 | 110110001221112101100000 |
4 | 1321100212022322123 |
5 | 4113123001433311 |
6 | 135451423344043 |
7 | 12256335650034 |
oct | 1712046127233 |
9 | 413057471300 |
10 | 130201202331 |
11 | 50244203452 |
12 | 21298152023 |
13 | c37c790175 |
14 | 64320c1a8b |
15 | 35c0859056 |
hex | 1e5098ae9b |
130201202331 has 24 divisors (see below), whose sum is σ = 195052777920. Its totient is φ = 86792400072.
The previous prime is 130201202317. The next prime is 130201202333. The reversal of 130201202331 is 133202102031.
130201202331 is a `hidden beast` number, since 130 + 2 + 0 + 1 + 202 + 331 = 666.
It is not a de Polignac number, because 130201202331 - 27 = 130201202203 is a prime.
It is a super-2 number, since 2×1302012023312 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (130201202333) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3442240 + ... + 3479858.
It is an arithmetic number, because the mean of its divisors is an integer number (8127199080).
Almost surely, 2130201202331 is an apocalyptic number.
130201202331 is a deficient number, since it is larger than the sum of its proper divisors (64851575589).
130201202331 is an equidigital number, since it uses as much as digits as its factorization.
130201202331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51877 (or 51865 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 130201202331 its reverse (133202102031), we get a palindrome (263403304362).
The spelling of 130201202331 in words is "one hundred thirty billion, two hundred one million, two hundred two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •