Base | Representation |
---|---|
bin | 11101001001100101000… |
… | …011010000111101100101 |
3 | 21002111110222100020220110 |
4 | 131021211003100331211 |
5 | 230304422412132121 |
6 | 4132122350523233 |
7 | 264502633015563 |
oct | 35114503207545 |
9 | 7074428306813 |
10 | 2003150114661 |
11 | 702593021633 |
12 | 284282b06519 |
13 | 116b86087a47 |
14 | 6cd4adb0a33 |
15 | 3718e824d76 |
hex | 1d2650d0f65 |
2003150114661 has 16 divisors (see below), whose sum is σ = 2671802774784. Its totient is φ = 1334965539264.
The previous prime is 2003150114639. The next prime is 2003150114683. The reversal of 2003150114661 is 1664110513002.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (2003150114639) and next prime (2003150114683).
It is not a de Polignac number, because 2003150114661 - 29 = 2003150114149 is a prime.
It is a super-2 number, since 2×20031501146612 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2003150114621) 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, 176997975 + ... + 177009291.
It is an arithmetic number, because the mean of its divisors is an integer number (166987673424).
Almost surely, 22003150114661 is an apocalyptic number.
It is an amenable number.
2003150114661 is a deficient number, since it is larger than the sum of its proper divisors (668652660123).
2003150114661 is a wasteful number, since it uses less digits than its factorization.
2003150114661 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26780.
The product of its (nonzero) digits is 4320, while the sum is 30.
Adding to 2003150114661 its reverse (1664110513002), we get a palindrome (3667260627663).
The spelling of 2003150114661 in words is "two trillion, three billion, one hundred fifty million, one hundred fourteen thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •