Base | Representation |
---|---|
bin | 111100101011010001… |
… | …0111100100010101101 |
3 | 110110022220100122220001 |
4 | 1321112202330202231 |
5 | 4113324030122313 |
6 | 135505351024301 |
7 | 12261660253441 |
oct | 1712642744255 |
9 | 413286318801 |
10 | 130301020333 |
11 | 50295590170 |
12 | 2130566b091 |
13 | c39736bb83 |
14 | 6441466821 |
15 | 35c94c4add |
hex | 1e568bc8ad |
130301020333 has 4 divisors (see below), whose sum is σ = 142146567648. Its totient is φ = 118455473020.
The previous prime is 130301020327. The next prime is 130301020349. The reversal of 130301020333 is 333020103031.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130301020333 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 130301020333.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130301020393) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5922773641 + ... + 5922773662.
It is an arithmetic number, because the mean of its divisors is an integer number (35536641912).
Almost surely, 2130301020333 is an apocalyptic number.
It is an amenable number.
130301020333 is a deficient number, since it is larger than the sum of its proper divisors (11845547315).
130301020333 is a wasteful number, since it uses less digits than its factorization.
130301020333 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11845547314.
The product of its (nonzero) digits is 486, while the sum is 19.
Adding to 130301020333 its reverse (333020103031), we get a palindrome (463321123364).
The spelling of 130301020333 in words is "one hundred thirty billion, three hundred one million, twenty thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •