Base | Representation |
---|---|
bin | 101110101101101010101… |
… | …011010110111011101101 |
3 | 102100212220111112121001112 |
4 | 232231222223112323231 |
5 | 410043321330234013 |
6 | 10454414041321405 |
7 | 450632010342041 |
oct | 56555253267355 |
9 | 12325814477045 |
10 | 3210130321133 |
11 | 10284549730aa |
12 | 43a18a196265 |
13 | 1a3938838228 |
14 | b152a582021 |
15 | 58782219ba8 |
hex | 2eb6aad6eed |
3210130321133 has 8 divisors (see below), whose sum is σ = 3251195539200. Its totient is φ = 3169075869648.
The previous prime is 3210130321067. The next prime is 3210130321207. The reversal of 3210130321133 is 3311230310123.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3210130321133 - 28 = 3210130320877 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3210130321099 and 3210130321108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3210130327133) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2090666 + ... + 3284987.
It is an arithmetic number, because the mean of its divisors is an integer number (406399442400).
Almost surely, 23210130321133 is an apocalyptic number.
It is an amenable number.
3210130321133 is a deficient number, since it is larger than the sum of its proper divisors (41065218067).
3210130321133 is an equidigital number, since it uses as much as digits as its factorization.
3210130321133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5383291.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 3210130321133 its reverse (3311230310123), we get a palindrome (6521360631256).
The spelling of 3210130321133 in words is "three trillion, two hundred ten billion, one hundred thirty million, three hundred twenty-one thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •