Base | Representation |
---|---|
bin | 101110110000101101100… |
… | …100111111111111101001 |
3 | 102101012100101102020021200 |
4 | 232300231210333333221 |
5 | 410122020423231213 |
6 | 10500114330354413 |
7 | 451106024060646 |
oct | 56605544777751 |
9 | 12335311366250 |
10 | 3213400211433 |
11 | 1029882712085 |
12 | 43a94128ba09 |
13 | 1a403a107669 |
14 | b175a960dcd |
15 | 588c4321273 |
hex | 2ec2d93ffe9 |
3213400211433 has 48 divisors (see below), whose sum is σ = 5253371375616. Its totient is φ = 1881549204480.
The previous prime is 3213400211419. The next prime is 3213400211449. The reversal of 3213400211433 is 3341120043123.
It is a happy number.
3213400211433 is a `hidden beast` number, since 3 + 2 + 1 + 3 + 400 + 211 + 43 + 3 = 666.
It is not a de Polignac number, because 3213400211433 - 26 = 3213400211369 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3213400211397 and 3213400211406.
It is not an unprimeable number, because it can be changed into a prime (3213400261433) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 10991785 + ... + 11280342.
It is an arithmetic number, because the mean of its divisors is an integer number (109445236992).
Almost surely, 23213400211433 is an apocalyptic number.
It is an amenable number.
3213400211433 is a deficient number, since it is larger than the sum of its proper divisors (2039971164183).
3213400211433 is a wasteful number, since it uses less digits than its factorization.
3213400211433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22272214 (or 22272211 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 27.
Adding to 3213400211433 its reverse (3341120043123), we get a palindrome (6554520254556).
The spelling of 3213400211433 in words is "three trillion, two hundred thirteen billion, four hundred million, two hundred eleven thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •