Base | Representation |
---|---|
bin | 111100101011110111… |
… | …1010010100001110101 |
3 | 110110101022000102120021 |
4 | 1321113233102201311 |
5 | 4113344141031313 |
6 | 135511344005141 |
7 | 12262322335411 |
oct | 1712757224165 |
9 | 413338012507 |
10 | 130321033333 |
11 | 502a590a237 |
12 | 213103007b1 |
13 | c39b55819a |
14 | 6443d95d41 |
15 | 35cb12978d |
hex | 1e57bd2875 |
130321033333 has 4 divisors (see below), whose sum is σ = 130781531968. Its totient is φ = 129860534700.
The previous prime is 130321033327. The next prime is 130321033357. The reversal of 130321033333 is 333330123031.
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 not a de Polignac number, because 130321033333 - 25 = 130321033301 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130321033298 and 130321033307.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130321033433) 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, 230248893 + ... + 230249458.
It is an arithmetic number, because the mean of its divisors is an integer number (32695382992).
Almost surely, 2130321033333 is an apocalyptic number.
It is an amenable number.
130321033333 is a deficient number, since it is larger than the sum of its proper divisors (460498635).
130321033333 is an equidigital number, since it uses as much as digits as its factorization.
130321033333 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 460498634.
The product of its (nonzero) digits is 4374, while the sum is 25.
Adding to 130321033333 its reverse (333330123031), we get a palindrome (463651156364).
The spelling of 130321033333 in words is "one hundred thirty billion, three hundred twenty-one million, thirty-three thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •