Base | Representation |
---|---|
bin | 11101010100000110001… |
… | …111101010101100001101 |
3 | 21010120122002121000211021 |
4 | 131110012033222230031 |
5 | 231001040233312031 |
6 | 4141231211154141 |
7 | 265352545103101 |
oct | 35240617525415 |
9 | 7116562530737 |
10 | 2014444432141 |
11 | 707359402509 |
12 | 2864b5445951 |
13 | 117c65c7083b |
14 | 6d6dcdb5901 |
15 | 3760114e511 |
hex | 1d5063eab0d |
2014444432141 has 8 divisors (see below), whose sum is σ = 2019920122368. Its totient is φ = 2008974324000.
The previous prime is 2014444432139. The next prime is 2014444432267. The reversal of 2014444432141 is 1412344444102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2014444432141 - 21 = 2014444432139 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2014444432097 and 2014444432106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2014444432541) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 672280 + ... + 2116801.
It is an arithmetic number, because the mean of its divisors is an integer number (252490015296).
Almost surely, 22014444432141 is an apocalyptic number.
It is an amenable number.
2014444432141 is a deficient number, since it is larger than the sum of its proper divisors (5475690227).
2014444432141 is a wasteful number, since it uses less digits than its factorization.
2014444432141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2791043.
The product of its (nonzero) digits is 49152, while the sum is 34.
Adding to 2014444432141 its reverse (1412344444102), we get a palindrome (3426788876243).
The spelling of 2014444432141 in words is "two trillion, fourteen billion, four hundred forty-four million, four hundred thirty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •