Base | Representation |
---|---|
bin | 1111100001100… |
… | …11001100101101 |
3 | 100002001112021101 |
4 | 13300303030231 |
5 | 231314430013 |
6 | 20531203101 |
7 | 3140651302 |
oct | 760631455 |
9 | 302045241 |
10 | 130233133 |
11 | 67571098 |
12 | 37746491 |
13 | 20c9a934 |
14 | 134210a9 |
15 | b6778dd |
hex | 7c3332d |
130233133 has 4 divisors (see below), whose sum is σ = 130283388. Its totient is φ = 130182880.
The previous prime is 130233127. The next prime is 130233149. The reversal of 130233133 is 331332031.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 33663204 + 96569929 = 5802^2 + 9827^2 .
It is a cyclic number.
It is not a de Polignac number, because 130233133 - 25 = 130233101 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 130233133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130203133) 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, 21016 + ... + 26497.
It is an arithmetic number, because the mean of its divisors is an integer number (32570847).
Almost surely, 2130233133 is an apocalyptic number.
It is an amenable number.
130233133 is a deficient number, since it is larger than the sum of its proper divisors (50255).
130233133 is an equidigital number, since it uses as much as digits as its factorization.
130233133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50254.
The product of its (nonzero) digits is 486, while the sum is 19.
The square root of 130233133 is about 11411.9732299020. The cubic root of 130233133 is about 506.8823427259.
Adding to 130233133 its reverse (331332031), we get a palindrome (461565164).
The spelling of 130233133 in words is "one hundred thirty million, two hundred thirty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •