Base | Representation |
---|---|
bin | 101110101111100111110… |
… | …101000000101010000011 |
3 | 102101002022211110111112212 |
4 | 232233213311000222003 |
5 | 410112121340101311 |
6 | 10455402245012335 |
7 | 451035024343346 |
oct | 56574765005203 |
9 | 12332284414485 |
10 | 3212230003331 |
11 | 1029332104448 |
12 | 43a6753b40ab |
13 | 1a3bb184452b |
14 | b168938845d |
15 | 5885671cc8b |
hex | 2ebe7d40a83 |
3212230003331 has 8 divisors (see below), whose sum is σ = 3372593520720. Its totient is φ = 3055172950368.
The previous prime is 3212230003289. The next prime is 3212230003337. The reversal of 3212230003331 is 1333000322123.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3212230003331 - 26 = 3212230003267 is a prime.
It is a super-2 number, since 2×32122300033312 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3212230003297 and 3212230003306.
It is not an unprimeable number, because it can be changed into a prime (3212230003337) 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, 826614116 + ... + 826618001.
It is an arithmetic number, because the mean of its divisors is an integer number (421574190090).
Almost surely, 23212230003331 is an apocalyptic number.
3212230003331 is a deficient number, since it is larger than the sum of its proper divisors (160363517389).
3212230003331 is a wasteful number, since it uses less digits than its factorization.
3212230003331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1653232213.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 3212230003331 its reverse (1333000322123), we get a palindrome (4545230325454).
The spelling of 3212230003331 in words is "three trillion, two hundred twelve billion, two hundred thirty million, three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •