Base | Representation |
---|---|
bin | 11101001001100010001… |
… | …000000001111100010101 |
3 | 21002111100112222121110000 |
4 | 131021202020001330111 |
5 | 230304322331012323 |
6 | 4132113434521513 |
7 | 264501465562221 |
oct | 35114210017425 |
9 | 7074315877400 |
10 | 2003101032213 |
11 | 702568348226 |
12 | 28426a596299 |
13 | 116b78b61188 |
14 | 6cd44675781 |
15 | 3718a37be43 |
hex | 1d262201f15 |
2003101032213 has 20 divisors (see below), whose sum is σ = 3004806784320. Its totient is φ = 1329813224712.
The previous prime is 2003101032173. The next prime is 2003101032241. The reversal of 2003101032213 is 3122301013002.
2003101032213 is a `hidden beast` number, since 20 + 0 + 310 + 1 + 0 + 322 + 13 = 666.
It is not a de Polignac number, because 2003101032213 - 213 = 2003101024021 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2003101032113) 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 19 ways as a sum of consecutive naturals, for example, 51716295 + ... + 51755012.
It is an arithmetic number, because the mean of its divisors is an integer number (150240339216).
Almost surely, 22003101032213 is an apocalyptic number.
It is an amenable number.
2003101032213 is a deficient number, since it is larger than the sum of its proper divisors (1001705752107).
2003101032213 is a wasteful number, since it uses less digits than its factorization.
2003101032213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103471558 (or 103471549 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 2003101032213 its reverse (3122301013002), we get a palindrome (5125402045215).
The spelling of 2003101032213 in words is "two trillion, three billion, one hundred one million, thirty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •