Base | Representation |
---|---|
bin | 1001100011110110110011… |
… | …01111101011001001101011 |
3 | 2202102210121120020122102000 |
4 | 10301323121233223021223 |
5 | 10223421030103200021 |
6 | 112413534012142043 |
7 | 4266610031614566 |
oct | 461733157531153 |
9 | 82383546218360 |
10 | 21023223100011 |
11 | 6775998402770 |
12 | 2436536a67923 |
13 | b96634923172 |
14 | 52975aa694dd |
15 | 266ce02cab26 |
hex | 131ed9beb26b |
21023223100011 has 32 divisors (see below), whose sum is σ = 34327203859200. Its totient is φ = 12609993219840.
The previous prime is 21023223099973. The next prime is 21023223100037. The reversal of 21023223100011 is 11000132232012.
21023223100011 is a `hidden beast` number, since 21 + 0 + 2 + 322 + 310 + 0 + 0 + 11 = 666.
It is not a de Polignac number, because 21023223100011 - 211 = 21023223097963 is a prime.
It is a super-2 number, since 2×210232231000112 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (21023223104011) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 364843681 + ... + 364901298.
It is an arithmetic number, because the mean of its divisors is an integer number (1072725120600).
Almost surely, 221023223100011 is an apocalyptic number.
21023223100011 is a deficient number, since it is larger than the sum of its proper divisors (13303980759189).
21023223100011 is a wasteful number, since it uses less digits than its factorization.
21023223100011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 729745096 (or 729745090 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 21023223100011 its reverse (11000132232012), we get a palindrome (32023355332023).
The spelling of 21023223100011 in words is "twenty-one trillion, twenty-three billion, two hundred twenty-three million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •