Base | Representation |
---|---|
bin | 111100101011111000… |
… | …0000010110010111001 |
3 | 110110101022101110202111 |
4 | 1321113300002302321 |
5 | 4113344213343113 |
6 | 135511352132321 |
7 | 12262324120660 |
oct | 1712760026271 |
9 | 413338343674 |
10 | 130321231033 |
11 | 502a5a34824 |
12 | 213103970a1 |
13 | c39b5c7176 |
14 | 6444007dd7 |
15 | 35cb16813d |
hex | 1e57c02cb9 |
130321231033 has 8 divisors (see below), whose sum is σ = 148940740352. Its totient is φ = 111702269376.
The previous prime is 130321231013. The next prime is 130321231069. The reversal of 130321231033 is 330132123031.
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 130321231033 - 221 = 130319133881 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130321230995 and 130321231013.
It is not an unprimeable number, because it can be changed into a prime (130321231013) 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 7 ways as a sum of consecutive naturals, for example, 805216 + ... + 953422.
It is an arithmetic number, because the mean of its divisors is an integer number (18617592544).
Almost surely, 2130321231033 is an apocalyptic number.
It is an amenable number.
130321231033 is a deficient number, since it is larger than the sum of its proper divisors (18619509319).
130321231033 is a wasteful number, since it uses less digits than its factorization.
130321231033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 273831.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 130321231033 its reverse (330132123031), we get a palindrome (460453354064).
The spelling of 130321231033 in words is "one hundred thirty billion, three hundred twenty-one million, two hundred thirty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •