Base | Representation |
---|---|
bin | 1011101101111110011… |
… | …0110111010111010111 |
3 | 201020122100002210020120 |
4 | 2323133212313113113 |
5 | 11244300410044111 |
6 | 232252442203023 |
7 | 20354616535230 |
oct | 2733746672727 |
9 | 636570083216 |
10 | 201320003031 |
11 | 78419990aa4 |
12 | 330257b3473 |
13 | 15ca493ba64 |
14 | 9a5b52c087 |
15 | 53842b6406 |
hex | 2edf9b75d7 |
201320003031 has 16 divisors (see below), whose sum is σ = 315064510464. Its totient is φ = 111930812064.
The previous prime is 201320003029. The next prime is 201320003069. The reversal of 201320003031 is 130300023102.
It is not a de Polignac number, because 201320003031 - 21 = 201320003029 is a prime.
It is a super-2 number, since 2×2013200030312 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 201320003031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201320003531) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 129548775 + ... + 129550328.
It is an arithmetic number, because the mean of its divisors is an integer number (19691531904).
Almost surely, 2201320003031 is an apocalyptic number.
201320003031 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
201320003031 is a deficient number, since it is larger than the sum of its proper divisors (113744507433).
201320003031 is a wasteful number, since it uses less digits than its factorization.
201320003031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 259099150.
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 201320003031 its reverse (130300023102), we get a palindrome (331620026133).
The spelling of 201320003031 in words is "two hundred one billion, three hundred twenty million, three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •