Base | Representation |
---|---|
bin | 111011101101001110100… |
… | …010000100100010000101 |
3 | 112112020120220200001100220 |
4 | 323231032202010202011 |
5 | 1014210431344300424 |
6 | 12420521500054553 |
7 | 602301305541036 |
oct | 73551642044205 |
9 | 15466526601326 |
10 | 4103011321989 |
11 | 1342093a20528 |
12 | 563236234459 |
13 | 239bb2454bb8 |
14 | 1028302b2a8d |
15 | 71ade773579 |
hex | 3bb4e884885 |
4103011321989 has 32 divisors (see below), whose sum is σ = 5560585003008. Its totient is φ = 2690571408000.
The previous prime is 4103011321973. The next prime is 4103011321993. The reversal of 4103011321989 is 9891231103014.
It is not a de Polignac number, because 4103011321989 - 24 = 4103011321973 is a prime.
It is a super-2 number, since 2×41030113219892 (a number of 26 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 4103011321989.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4103011321939) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 560440449 + ... + 560447769.
It is an arithmetic number, because the mean of its divisors is an integer number (173768281344).
Almost surely, 24103011321989 is an apocalyptic number.
It is an amenable number.
4103011321989 is a deficient number, since it is larger than the sum of its proper divisors (1457573681019).
4103011321989 is a wasteful number, since it uses less digits than its factorization.
4103011321989 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13129.
The product of its (nonzero) digits is 46656, while the sum is 42.
The spelling of 4103011321989 in words is "four trillion, one hundred three billion, eleven million, three hundred twenty-one thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •