Base | Representation |
---|---|
bin | 100001111011111000100… |
… | …011001000000100100111 |
3 | 22020221102000212220212100 |
4 | 201323320203020010213 |
5 | 301202010302411403 |
6 | 4543154142223143 |
7 | 330325115623623 |
oct | 41737043100447 |
9 | 8227360786770 |
10 | 2332042232103 |
11 | 81a017053341 |
12 | 317b70284ab3 |
13 | 13bbab89ac1c |
14 | 80c2b36a183 |
15 | 409dd71b2a3 |
hex | 21ef88c8127 |
2332042232103 has 24 divisors (see below), whose sum is σ = 3391053485456. Its totient is φ = 1544294419200.
The previous prime is 2332042232077. The next prime is 2332042232123. The reversal of 2332042232103 is 3012322402332.
2332042232103 is a `hidden beast` number, since 2 + 3 + 3 + 20 + 422 + 3 + 210 + 3 = 666.
It is not a de Polignac number, because 2332042232103 - 241 = 133018976551 is a prime.
It is a super-4 number, since 4×23320422321034 (a number of 51 digits) contains 4444 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2332042232123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4145568 + ... + 4674378.
Almost surely, 22332042232103 is an apocalyptic number.
2332042232103 is a deficient number, since it is larger than the sum of its proper divisors (1059011253353).
2332042232103 is a wasteful number, since it uses less digits than its factorization.
2332042232103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 532095 (or 532092 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 27.
Adding to 2332042232103 its reverse (3012322402332), we get a palindrome (5344364634435).
The spelling of 2332042232103 in words is "two trillion, three hundred thirty-two billion, forty-two million, two hundred thirty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •