Base | Representation |
---|---|
bin | 1010011110010001000110… |
… | …00011000010110010011010 |
3 | 10000112122222102022221110000 |
4 | 11033020203003002302122 |
5 | 11004311323334012222 |
6 | 120551532401033430 |
7 | 4564606614343404 |
oct | 517104303026232 |
9 | 100478872287400 |
10 | 23030202641562 |
11 | 737a065aa4406 |
12 | 26bb4a8325876 |
13 | cb097b17947c |
14 | 59894c46bb74 |
15 | 29e105dd09ac |
hex | 14f2230c2c9a |
23030202641562 has 40 divisors (see below), whose sum is σ = 51616877184576. Its totient is φ = 7674924714408.
The previous prime is 23030202641441. The next prime is 23030202641569. The reversal of 23030202641562 is 26514620203032.
23030202641562 is a `hidden beast` number, since 2 + 3 + 0 + 3 + 0 + 2 + 0 + 2 + 641 + 5 + 6 + 2 = 666.
It is a super-2 number, since 2×230302026415622 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (23030202641569) 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 19 ways as a sum of consecutive naturals, for example, 16065138 + ... + 17439869.
Almost surely, 223030202641562 is an apocalyptic number.
23030202641562 is an abundant number, since it is smaller than the sum of its proper divisors (28586674543014).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23030202641562 is a wasteful number, since it uses less digits than its factorization.
23030202641562 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33509264 (or 33509255 counting only the distinct ones).
The product of its (nonzero) digits is 103680, while the sum is 36.
Adding to 23030202641562 its reverse (26514620203032), we get a palindrome (49544822844594).
The spelling of 23030202641562 in words is "twenty-three trillion, thirty billion, two hundred two million, six hundred forty-one thousand, five hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •