Base | Representation |
---|---|
bin | 10010111011111101… |
… | …000000011110010101 |
3 | 1221111001111122111200 |
4 | 102323331000132111 |
5 | 313120244420201 |
6 | 13201351023113 |
7 | 1316606234160 |
oct | 227375003625 |
9 | 57431448450 |
10 | 20333201301 |
11 | 86946200a6 |
12 | 3b3566aa99 |
13 | 1bc072b87a |
14 | dac65cad7 |
15 | 7e0137386 |
hex | 4bbf40795 |
20333201301 has 12 divisors (see below), whose sum is σ = 33565919712. Its totient is φ = 11618972136.
The previous prime is 20333201257. The next prime is 20333201327. The reversal of 20333201301 is 10310233302.
20333201301 is a `hidden beast` number, since 203 + 332 + 0 + 130 + 1 = 666.
It is not a de Polignac number, because 20333201301 - 27 = 20333201173 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20333209301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 161374551 + ... + 161374676.
It is an arithmetic number, because the mean of its divisors is an integer number (2797159976).
Almost surely, 220333201301 is an apocalyptic number.
20333201301 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
20333201301 is a deficient number, since it is larger than the sum of its proper divisors (13232718411).
20333201301 is a wasteful number, since it uses less digits than its factorization.
20333201301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 322749240 (or 322749237 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 18.
Adding to 20333201301 its reverse (10310233302), we get a palindrome (30643434603).
The spelling of 20333201301 in words is "twenty billion, three hundred thirty-three million, two hundred one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •