Base | Representation |
---|---|
bin | 1001101001111101100101… |
… | …01000001011011010101111 |
3 | 2210011212010200112122111011 |
4 | 10310332302220023122233 |
5 | 10240340211134033403 |
6 | 113054152000410051 |
7 | 4321015014666055 |
oct | 464766250133257 |
9 | 83155120478434 |
10 | 21233020221103 |
11 | 6846967409a59 |
12 | 246b127616927 |
13 | bb035a8a7cc2 |
14 | 53597dd7c1d5 |
15 | 26c4bd8d5a6d |
hex | 134fb2a0b6af |
21233020221103 has 4 divisors (see below), whose sum is σ = 21233167511400. Its totient is φ = 21232872930808.
The previous prime is 21233020221071. The next prime is 21233020221107. The reversal of 21233020221103 is 30112202033212.
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 21233020221103 - 25 = 21233020221071 is a prime.
It is a super-2 number, since 2×212330202211032 (a number of 27 digits) contains 22 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 (21233020221107) 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, 73428700 + ... + 73717297.
It is an arithmetic number, because the mean of its divisors is an integer number (5308291877850).
Almost surely, 221233020221103 is an apocalyptic number.
21233020221103 is a deficient number, since it is larger than the sum of its proper divisors (147290297).
21233020221103 is a wasteful number, since it uses less digits than its factorization.
21233020221103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 147290296.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 21233020221103 its reverse (30112202033212), we get a palindrome (51345222254315).
The spelling of 21233020221103 in words is "twenty-one trillion, two hundred thirty-three billion, twenty million, two hundred twenty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •