Base | Representation |
---|---|
bin | 1011110110100011111110… |
… | …1110110101111101101101 |
3 | 1201010211212111011222202202 |
4 | 2331220333232311331231 |
5 | 3202004014001122313 |
6 | 43414452420031245 |
7 | 2513350052315330 |
oct | 275507756657555 |
9 | 51124774158682 |
10 | 13032000020333 |
11 | 41749272a4698 |
12 | 1565832532525 |
13 | 736bb2503ba8 |
14 | 330a75d32617 |
15 | 178ed3b79558 |
hex | bda3fbb5f6d |
13032000020333 has 8 divisors (see below), whose sum is σ = 14924807662080. Its totient is φ = 11146965716880.
The previous prime is 13032000020323. The next prime is 13032000020339. The reversal of 13032000020333 is 33302000023031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13032000020333 - 26 = 13032000020269 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 (13032000020339) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1943330978 + ... + 1943337683.
It is an arithmetic number, because the mean of its divisors is an integer number (1865600957760).
Almost surely, 213032000020333 is an apocalyptic number.
It is an amenable number.
13032000020333 is a deficient number, since it is larger than the sum of its proper divisors (1892807641747).
13032000020333 is an equidigital number, since it uses as much as digits as its factorization.
13032000020333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3886669147.
The product of its (nonzero) digits is 972, while the sum is 20.
Adding to 13032000020333 its reverse (33302000023031), we get a palindrome (46334000043364).
The spelling of 13032000020333 in words is "thirteen trillion, thirty-two billion, twenty thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •