Base | Representation |
---|---|
bin | 110000011111010010011… |
… | …111011100000001011001 |
3 | 102210112210221112212021102 |
4 | 300133102133130001121 |
5 | 414043201031023001 |
6 | 11030432045521145 |
7 | 462511213056050 |
oct | 60372237340131 |
9 | 12715727485242 |
10 | 3332131111001 |
11 | 1075170164270 |
12 | 459957b731b5 |
13 | 1b22ac3b5314 |
14 | b73c150b397 |
15 | 5ba22b8be6b |
hex | 307d27dc059 |
3332131111001 has 16 divisors (see below), whose sum is σ = 4155592777728. Its totient is φ = 2595686115600.
The previous prime is 3332131110983. The next prime is 3332131111007. The reversal of 3332131111001 is 1001111312333.
3332131111001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3332131111001 is a prime.
It is a super-2 number, since 2×33321311110012 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (3332131111007) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6239225 + ... + 6752198.
It is an arithmetic number, because the mean of its divisors is an integer number (259724548608).
Almost surely, 23332131111001 is an apocalyptic number.
It is an amenable number.
3332131111001 is a deficient number, since it is larger than the sum of its proper divisors (823461666727).
3332131111001 is a wasteful number, since it uses less digits than its factorization.
3332131111001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12994772.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 3332131111001 its reverse (1001111312333), we get a palindrome (4333242423334).
The spelling of 3332131111001 in words is "three trillion, three hundred thirty-two billion, one hundred thirty-one million, one hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.767 sec. • engine limits •