Base | Representation |
---|---|
bin | 1111100011110… |
… | …01010100001101 |
3 | 100002121010020102 |
4 | 13301321110031 |
5 | 231403122313 |
6 | 20541300445 |
7 | 3143255516 |
oct | 761712415 |
9 | 302533212 |
10 | 130520333 |
11 | 67747949 |
12 | 37864725 |
13 | 2106b588 |
14 | 13497a0d |
15 | b6d2a58 |
hex | 7c7950d |
130520333 has 4 divisors (see below), whose sum is σ = 130638300. Its totient is φ = 130402368.
The previous prime is 130520281. The next prime is 130520347. The reversal of 130520333 is 333025031.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 333025031 = 3433 ⋅97007.
It can be written as a sum of positive squares in 2 ways, for example, as 53027524 + 77492809 = 7282^2 + 8803^2 .
It is a cyclic number.
It is not a de Polignac number, because 130520333 - 28 = 130520077 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130523333) 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, 57308 + ... + 59541.
It is an arithmetic number, because the mean of its divisors is an integer number (32659575).
Almost surely, 2130520333 is an apocalyptic number.
It is an amenable number.
130520333 is a deficient number, since it is larger than the sum of its proper divisors (117967).
130520333 is a wasteful number, since it uses less digits than its factorization.
130520333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117966.
The product of its (nonzero) digits is 810, while the sum is 20.
The square root of 130520333 is about 11424.5495753662. The cubic root of 130520333 is about 507.2546743136.
Adding to 130520333 its reverse (333025031), we get a palindrome (463545364).
The spelling of 130520333 in words is "one hundred thirty million, five hundred twenty thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •