Base | Representation |
---|---|
bin | 1001001111101011110001… |
… | …00100110010100100101111 |
3 | 2122222112112211201120212120 |
4 | 10213311320210302210233 |
5 | 10131042022344402343 |
6 | 111123304225404023 |
7 | 4165541623201056 |
oct | 447657044624457 |
9 | 78875484646776 |
10 | 20330103122223 |
11 | 6528a48231644 |
12 | 234413a499613 |
13 | b461749723ab |
14 | 503da73ad39d |
15 | 253c7523d683 |
hex | 127d7893292f |
20330103122223 has 4 divisors (see below), whose sum is σ = 27106804162968. Its totient is φ = 13553402081480.
The previous prime is 20330103122221. The next prime is 20330103122279. The reversal of 20330103122223 is 32222130103302.
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 20330103122223 - 21 = 20330103122221 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20330103122193 and 20330103122202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20330103122221) 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, 3388350520368 + ... + 3388350520373.
It is an arithmetic number, because the mean of its divisors is an integer number (6776701040742).
Almost surely, 220330103122223 is an apocalyptic number.
20330103122223 is a deficient number, since it is larger than the sum of its proper divisors (6776701040745).
20330103122223 is an equidigital number, since it uses as much as digits as its factorization.
20330103122223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6776701040744.
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 20330103122223 its reverse (32222130103302), we get a palindrome (52552233225525).
The spelling of 20330103122223 in words is "twenty trillion, three hundred thirty billion, one hundred three million, one hundred twenty-two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •