Base | Representation |
---|---|
bin | 1010011110010001000110… |
… | …00011000010110010011011 |
3 | 10000112122222102022221110001 |
4 | 11033020203003002302123 |
5 | 11004311323334012223 |
6 | 120551532401033431 |
7 | 4564606614343405 |
oct | 517104303026233 |
9 | 100478872287401 |
10 | 23030202641563 |
11 | 737a065aa4407 |
12 | 26bb4a8325877 |
13 | cb097b179480 |
14 | 59894c46bb75 |
15 | 29e105dd09ad |
hex | 14f2230c2c9b |
23030202641563 has 4 divisors (see below), whose sum is σ = 24801756690928. Its totient is φ = 21258648592200.
The previous prime is 23030202641441. The next prime is 23030202641569. The reversal of 23030202641563 is 36514620203032.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 23030202641563 - 225 = 23030169087131 is a prime.
It is a super-2 number, since 2×230302026415632 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23030202641569) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 885777024663 + ... + 885777024688.
It is an arithmetic number, because the mean of its divisors is an integer number (6200439172732).
Almost surely, 223030202641563 is an apocalyptic number.
23030202641563 is a deficient number, since it is larger than the sum of its proper divisors (1771554049365).
23030202641563 is a wasteful number, since it uses less digits than its factorization.
23030202641563 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1771554049364.
The product of its (nonzero) digits is 155520, while the sum is 37.
Adding to 23030202641563 its reverse (36514620203032), we get a palindrome (59544822844595).
The spelling of 23030202641563 in words is "twenty-three trillion, thirty billion, two hundred two million, six hundred forty-one thousand, five hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •