Base | Representation |
---|---|
bin | 1001001001111011010111… |
… | …10110101011101110010101 |
3 | 2122021122001002011121100202 |
4 | 10210331223312223232111 |
5 | 10114321443212311313 |
6 | 110452354412550245 |
7 | 4145340454542020 |
oct | 444755366535625 |
9 | 78248032147322 |
10 | 20132321213333 |
11 | 646208452709a |
12 | 2311941782385 |
13 | b3061504a184 |
14 | 4d85a3b181b7 |
15 | 24da4b8ab558 |
hex | 124f6bdabb95 |
20132321213333 has 16 divisors (see below), whose sum is σ = 23147720797056. Its totient is φ = 17151814860480.
The previous prime is 20132321213287. The next prime is 20132321213339. The reversal of 20132321213333 is 33331212323102.
It is a cyclic number.
It is not a de Polignac number, because 20132321213333 - 210 = 20132321212309 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 20132321213296 and 20132321213305.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20132321213339) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2129963 + ... + 6693383.
It is an arithmetic number, because the mean of its divisors is an integer number (1446732549816).
Almost surely, 220132321213333 is an apocalyptic number.
It is an amenable number.
20132321213333 is a deficient number, since it is larger than the sum of its proper divisors (3015399583723).
20132321213333 is a wasteful number, since it uses less digits than its factorization.
20132321213333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4567244.
The product of its (nonzero) digits is 11664, while the sum is 29.
Adding to 20132321213333 its reverse (33331212323102), we get a palindrome (53463533536435).
The spelling of 20132321213333 in words is "twenty trillion, one hundred thirty-two billion, three hundred twenty-one million, two hundred thirteen thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •