Base | Representation |
---|---|
bin | 11110111001011111010… |
… | …100110001000000000100 |
3 | 21111222122100020120021002 |
4 | 132321133110301000010 |
5 | 234242021124421312 |
6 | 4303234145112432 |
7 | 306255451521122 |
oct | 36713724610004 |
9 | 7458570216232 |
10 | 2123313123332 |
11 | 7495459a3565 |
12 | 2a3619328718 |
13 | 1252c5c7713b |
14 | 74aa9c2a912 |
15 | 3a373c794c2 |
hex | 1ee5f531004 |
2123313123332 has 48 divisors (see below), whose sum is σ = 4061829542400. Its totient is φ = 968069182080.
The previous prime is 2123313123331. The next prime is 2123313123341. The reversal of 2123313123332 is 2333213133212.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a junction number, because it is equal to n+sod(n) for n = 2123313123295 and 2123313123304.
It is not an unprimeable number, because it can be changed into a prime (2123313123331) 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 15 ways as a sum of consecutive naturals, for example, 4826219 + ... + 5247762.
It is an arithmetic number, because the mean of its divisors is an integer number (84621448800).
Almost surely, 22123313123332 is an apocalyptic number.
It is an amenable number.
2123313123332 is a deficient number, since it is larger than the sum of its proper divisors (1938516419068).
2123313123332 is a wasteful number, since it uses less digits than its factorization.
2123313123332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10074116 (or 10074114 counting only the distinct ones).
The product of its digits is 11664, while the sum is 29.
Adding to 2123313123332 its reverse (2333213133212), we get a palindrome (4456526256544).
The spelling of 2123313123332 in words is "two trillion, one hundred twenty-three billion, three hundred thirteen million, one hundred twenty-three thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •