Base | Representation |
---|---|
bin | 101110001010000100011101… |
… | …111010000101111001010001 |
3 | 222121202210222112210000120101 |
4 | 232022010131322011321101 |
5 | 203101441331014410301 |
6 | 1555425520324012401 |
7 | 60521264023014232 |
oct | 5612043572057121 |
9 | 877683875700511 |
10 | 203002131013201 |
11 | 597567a177a863 |
12 | 1a92720ab31101 |
13 | 8937032447b30 |
14 | 381b4d995b089 |
15 | 1870840924701 |
hex | b8a11de85e51 |
203002131013201 has 8 divisors (see below), whose sum is σ = 218618023022784. Its totient is φ = 187386288070800.
The previous prime is 203002131013153. The next prime is 203002131013217. The reversal of 203002131013201 is 102310131200302.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 203002131013201 - 211 = 203002131011153 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (203002131013901) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3438775 + ... + 20440876.
It is an arithmetic number, because the mean of its divisors is an integer number (27327252877848).
Almost surely, 2203002131013201 is an apocalyptic number.
It is an amenable number.
203002131013201 is a deficient number, since it is larger than the sum of its proper divisors (15615892009583).
203002131013201 is a wasteful number, since it uses less digits than its factorization.
203002131013201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24533591.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 203002131013201 its reverse (102310131200302), we get a palindrome (305312262213503).
The spelling of 203002131013201 in words is "two hundred three trillion, two billion, one hundred thirty-one million, thirteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •