Base | Representation |
---|---|
bin | 11101010011101011110… |
… | …100001100000111110001 |
3 | 21010112111012020102200011 |
4 | 131103223310030013301 |
5 | 230444133230141200 |
6 | 4141115211254521 |
7 | 265335552136351 |
oct | 35235364140761 |
9 | 7115435212604 |
10 | 2014001021425 |
11 | 707151087478 |
12 | 2863b0a4a441 |
13 | 117bc5140133 |
14 | 6d69a150b61 |
15 | 375c72635ba |
hex | 1d4ebd0c1f1 |
2014001021425 has 24 divisors (see below), whose sum is σ = 2529563115456. Its totient is φ = 1590524139840.
The previous prime is 2014001021339. The next prime is 2014001021437. The reversal of 2014001021425 is 5241201004102.
It is not a de Polignac number, because 2014001021425 - 237 = 1876562067953 is a prime.
It is a super-2 number, since 2×20140010214252 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2014001021396 and 2014001021405.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 417379 + ... + 2049928.
It is an arithmetic number, because the mean of its divisors is an integer number (105398463144).
Almost surely, 22014001021425 is an apocalyptic number.
2014001021425 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
2014001021425 is a deficient number, since it is larger than the sum of its proper divisors (515562094031).
2014001021425 is a wasteful number, since it uses less digits than its factorization.
2014001021425 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2467737 (or 2467732 counting only the distinct ones).
The product of its (nonzero) digits is 640, while the sum is 22.
Adding to 2014001021425 its reverse (5241201004102), we get a palindrome (7255202025527).
The spelling of 2014001021425 in words is "two trillion, fourteen billion, one million, twenty-one thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •