Base | Representation |
---|---|
bin | 1111100001100… |
… | …11001110000111 |
3 | 100002001112101201 |
4 | 13300303032013 |
5 | 231314430343 |
6 | 20531203331 |
7 | 3140651461 |
oct | 760631607 |
9 | 302045351 |
10 | 130233223 |
11 | 6757116a |
12 | 37746547 |
13 | 20c9a9a3 |
14 | 13421131 |
15 | b67794d |
hex | 7c33387 |
130233223 has 4 divisors (see below), whose sum is σ = 130263808. Its totient is φ = 130202640.
The previous prime is 130233203. The next prime is 130233281. The reversal of 130233223 is 322332031.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 322332031 = 7 ⋅46047433.
It is a cyclic number.
It is not a de Polignac number, because 130233223 - 217 = 130102151 is a prime.
It is a Duffinian number.
It is a zygodrome in base 2.
It is a self number, because there is not a number n which added to its sum of digits gives 130233223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130233203) 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, 7623 + ... + 17848.
It is an arithmetic number, because the mean of its divisors is an integer number (32565952).
Almost surely, 2130233223 is an apocalyptic number.
130233223 is a deficient number, since it is larger than the sum of its proper divisors (30585).
130233223 is an equidigital number, since it uses as much as digits as its factorization.
130233223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30584.
The product of its (nonzero) digits is 648, while the sum is 19.
The square root of 130233223 is about 11411.9771731282. The cubic root of 130233223 is about 506.8824594894.
Adding to 130233223 its reverse (322332031), we get a palindrome (452565254).
The spelling of 130233223 in words is "one hundred thirty million, two hundred thirty-three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •