Base | Representation |
---|---|
bin | 10010110100101000… |
… | …010010110111101001 |
3 | 1221011111022012021222 |
4 | 102310220102313221 |
5 | 312342321043423 |
6 | 13141241311425 |
7 | 1313554660100 |
oct | 226450226751 |
9 | 57144265258 |
10 | 20210331113 |
11 | 8631228995 |
12 | 3b00495575 |
13 | 1ba113b40b |
14 | d9a1d7037 |
15 | 7d44663c8 |
hex | 4b4a12de9 |
20210331113 has 12 divisors (see below), whose sum is σ = 23752353492. Its totient is φ = 17144547840.
The previous prime is 20210331107. The next prime is 20210331131. The reversal of 20210331113 is 31113301202.
It can be written as a sum of positive squares in 2 ways, for example, as 9091050409 + 11119280704 = 95347^2 + 105448^2 .
It is not a de Polignac number, because 20210331113 - 212 = 20210327017 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20210331091 and 20210331100.
It is not an unprimeable number, because it can be changed into a prime (20210333113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2121308 + ... + 2130813.
It is an arithmetic number, because the mean of its divisors is an integer number (1979362791).
Almost surely, 220210331113 is an apocalyptic number.
It is an amenable number.
20210331113 is a deficient number, since it is larger than the sum of its proper divisors (3542022379).
20210331113 is an equidigital number, since it uses as much as digits as its factorization.
20210331113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4252232 (or 4252225 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 20210331113 its reverse (31113301202), we get a palindrome (51323632315).
The spelling of 20210331113 in words is "twenty billion, two hundred ten million, three hundred thirty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •