Base | Representation |
---|---|
bin | 101110110000010101110… |
… | …111100011110001110100 |
3 | 102101011022122220111201000 |
4 | 232300111313203301310 |
5 | 410120212110022122 |
6 | 10500011040403300 |
7 | 451063123661055 |
oct | 56602567436164 |
9 | 12334278814630 |
10 | 3213002423412 |
11 | 1029699118051 |
12 | 43a850016530 |
13 | 1a3ca588bb32 |
14 | b171dbb472c |
15 | 5889e4480ac |
hex | 2ec15de3c74 |
3213002423412 has 48 divisors (see below), whose sum is σ = 8330820023680. Its totient is φ = 1070896184064.
The previous prime is 3213002423369. The next prime is 3213002423419. The reversal of 3213002423412 is 2143242003123.
3213002423412 is a `hidden beast` number, since 3 + 2 + 1 + 3 + 0 + 0 + 242 + 3 + 412 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3213002423419) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 338488 + ... + 2557455.
Almost surely, 23213002423412 is an apocalyptic number.
It is an amenable number.
3213002423412 is an abundant number, since it is smaller than the sum of its proper divisors (5117817600268).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3213002423412 is a wasteful number, since it uses less digits than its factorization.
3213002423412 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2906229 (or 2906221 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
Adding to 3213002423412 its reverse (2143242003123), we get a palindrome (5356244426535).
The spelling of 3213002423412 in words is "three trillion, two hundred thirteen billion, two million, four hundred twenty-three thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •