Base | Representation |
---|---|
bin | 110000010101001110001… |
… | …110011000010000001010 |
3 | 102202111220122111211011110 |
4 | 300111032032120100022 |
5 | 413404031430041020 |
6 | 11021443323311150 |
7 | 461646313100340 |
oct | 60251616302012 |
9 | 12674818454143 |
10 | 3321322112010 |
11 | 1070623822351 |
12 | 45784007b4b6 |
13 | 1b1278c13c26 |
14 | b6a77b59990 |
15 | 5b5ddc7a8e0 |
hex | 3054e39840a |
3321322112010 has 64 divisors (see below), whose sum is σ = 9424046995200. Its totient is φ = 732981430272.
The previous prime is 3321322111973. The next prime is 3321322112011. The reversal of 3321322112010 is 102112231233.
It is a super-2 number, since 2×33213221120102 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (3321322112011) 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, 272680455 + ... + 272692634.
It is an arithmetic number, because the mean of its divisors is an integer number (147250734300).
Almost surely, 23321322112010 is an apocalyptic number.
3321322112010 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
3321322112010 is an abundant number, since it is smaller than the sum of its proper divisors (6102724883190).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3321322112010 is a wasteful number, since it uses less digits than its factorization.
3321322112010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 545373135.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 3321322112010 its reverse (102112231233), we get a palindrome (3423434343243).
The spelling of 3321322112010 in words is "three trillion, three hundred twenty-one billion, three hundred twenty-two million, one hundred twelve thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •