Base | Representation |
---|---|
bin | 1001100011100000100110… |
… | …00100101010111000000011 |
3 | 2202101122211121211120120200 |
4 | 10301300103010222320003 |
5 | 10223222120300101311 |
6 | 112404242530540243 |
7 | 4266005413146021 |
oct | 461602304527003 |
9 | 82348747746520 |
10 | 21011300003331 |
11 | 677092a0a7760 |
12 | 2434169a37683 |
13 | b954846a6381 |
14 | 528d49349711 |
15 | 26684369b556 |
hex | 131c1312ae03 |
21011300003331 has 24 divisors (see below), whose sum is σ = 34003545302064. Its totient is φ = 12389955773760.
The previous prime is 21011300003311. The next prime is 21011300003399. The reversal of 21011300003331 is 13330000311012.
It is a happy number.
21011300003331 is a `hidden beast` number, since 21 + 0 + 11 + 300 + 0 + 0 + 3 + 331 = 666.
It is not a de Polignac number, because 21011300003331 - 25 = 21011300003299 is a prime.
It is a super-2 number, since 2×210113000033312 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (21011300003311) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2868041656 + ... + 2868048981.
It is an arithmetic number, because the mean of its divisors is an integer number (1416814387586).
Almost surely, 221011300003331 is an apocalyptic number.
21011300003331 is a deficient number, since it is larger than the sum of its proper divisors (12992245298733).
21011300003331 is a wasteful number, since it uses less digits than its factorization.
21011300003331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5736090691 (or 5736090688 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 18.
Adding to 21011300003331 its reverse (13330000311012), we get a palindrome (34341300314343).
The spelling of 21011300003331 in words is "twenty-one trillion, eleven billion, three hundred million, three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •