Base | Representation |
---|---|
bin | 101101111100111100010100… |
… | …100011101011100111100100 |
3 | 222111120120111122110210021212 |
4 | 231330330110203223213210 |
5 | 202442201330414330200 |
6 | 1553455250022130552 |
7 | 60366150112351202 |
oct | 5574742443534744 |
9 | 874516448423255 |
10 | 202100031011300 |
11 | 59439161850504 |
12 | 1a80040b580a58 |
13 | 889cc498a0066 |
14 | 37c999d6c8072 |
15 | 1857143d80035 |
hex | b7cf148eb9e4 |
202100031011300 has 18 divisors (see below), whose sum is σ = 438557067294738. Its totient is φ = 80840012404480.
The previous prime is 202100031011293. The next prime is 202100031011309. The reversal of 202100031011300 is 3110130001202.
It can be written as a sum of positive squares in 3 ways, for example, as 2153474070784 + 199946556940516 = 1467472^2 + 14140246^2 .
It is not an unprimeable number, because it can be changed into a prime (202100031011309) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1010500154957 + ... + 1010500155156.
Almost surely, 2202100031011300 is an apocalyptic number.
202100031011300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
202100031011300 is an abundant number, since it is smaller than the sum of its proper divisors (236457036283438).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
202100031011300 is a wasteful number, since it uses less digits than its factorization.
202100031011300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2021000310127 (or 2021000310120 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 202100031011300 its reverse (3110130001202), we get a palindrome (205210161012502).
The spelling of 202100031011300 in words is "two hundred two trillion, one hundred billion, thirty-one million, eleven thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •