Base | Representation |
---|---|
bin | 110000010110111110110… |
… | …101100110111110010001 |
3 | 102202200210022121211120112 |
4 | 300112332311212332101 |
5 | 413421414112202423 |
6 | 11022355014251105 |
7 | 462044164126241 |
oct | 60267665467621 |
9 | 12680708554515 |
10 | 3323211444113 |
11 | 1071403251540 |
12 | 458088956a95 |
13 | 1b14ba480c12 |
14 | b6bb6a47b21 |
15 | 5b69ea7ca78 |
hex | 305bed66f91 |
3323211444113 has 32 divisors (see below), whose sum is σ = 3732881318400. Its totient is φ = 2932792012800.
The previous prime is 3323211444109. The next prime is 3323211444143. The reversal of 3323211444113 is 3114441123233.
It is a cyclic number.
It is not a de Polignac number, because 3323211444113 - 22 = 3323211444109 is a prime.
It is a super-2 number, since 2×33232114441132 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 3323211444113.
It is not an unprimeable number, because it can be changed into a prime (3323211444143) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 150163433 + ... + 150185561.
It is an arithmetic number, because the mean of its divisors is an integer number (116652541200).
Almost surely, 23323211444113 is an apocalyptic number.
It is an amenable number.
3323211444113 is a deficient number, since it is larger than the sum of its proper divisors (409669874287).
3323211444113 is a wasteful number, since it uses less digits than its factorization.
3323211444113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25113.
The product of its digits is 20736, while the sum is 32.
Adding to 3323211444113 its reverse (3114441123233), we get a palindrome (6437652567346).
The spelling of 3323211444113 in words is "three trillion, three hundred twenty-three billion, two hundred eleven million, four hundred forty-four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •