Base | Representation |
---|---|
bin | 111101000001000000… |
… | …0101000010011010001 |
3 | 110112012201110221120102 |
4 | 1322002000220103101 |
5 | 4121322214101113 |
6 | 140110000222145 |
7 | 12316023340064 |
oct | 1720200502321 |
9 | 415181427512 |
10 | 131030222033 |
11 | 5062a1651a7 |
12 | 2148990a955 |
13 | c482463a79 |
14 | 64b02428db |
15 | 361d514758 |
hex | 1e820284d1 |
131030222033 has 8 divisors (see below), whose sum is σ = 132033070848. Its totient is φ = 130031081424.
The previous prime is 131030222027. The next prime is 131030222041. The reversal of 131030222033 is 330222030131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 131030222033 - 24 = 131030222017 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 131030221996 and 131030222014.
It is not an unprimeable number, because it can be changed into a prime (131030222003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 856091 + ... + 997472.
It is an arithmetic number, because the mean of its divisors is an integer number (16504133856).
Almost surely, 2131030222033 is an apocalyptic number.
It is an amenable number.
131030222033 is a deficient number, since it is larger than the sum of its proper divisors (1002848815).
131030222033 is a wasteful number, since it uses less digits than its factorization.
131030222033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1854103.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 131030222033 its reverse (330222030131), we get a palindrome (461252252164).
The spelling of 131030222033 in words is "one hundred thirty-one billion, thirty million, two hundred twenty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •