Base | Representation |
---|---|
bin | 11101101101110001100… |
… | …001100111001110000001 |
3 | 21020012210110210101112210 |
4 | 131231301201213032001 |
5 | 231424021102234101 |
6 | 4202031025012333 |
7 | 300350004324360 |
oct | 35556141471601 |
9 | 7205713711483 |
10 | 2042014102401 |
11 | 7180167a8869 |
12 | 28b90a4840a9 |
13 | 11a73a98abb0 |
14 | 70b967477d7 |
15 | 381b67107d6 |
hex | 1db71867381 |
2042014102401 has 128 divisors (see below), whose sum is σ = 3427703193600. Its totient is φ = 1052794195200.
The previous prime is 2042014102399. The next prime is 2042014102411. The reversal of 2042014102401 is 1042014102402.
It is not a de Polignac number, because 2042014102401 - 21 = 2042014102399 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (2042014102411) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 861244746 + ... + 861247116.
It is an arithmetic number, because the mean of its divisors is an integer number (26778931200).
Almost surely, 22042014102401 is an apocalyptic number.
2042014102401 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2042014102401 is a deficient number, since it is larger than the sum of its proper divisors (1385689091199).
2042014102401 is a wasteful number, since it uses less digits than its factorization.
2042014102401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2867.
The product of its (nonzero) digits is 512, while the sum is 21.
Adding to 2042014102401 its reverse (1042014102402), we get a palindrome (3084028204803).
Subtracting from 2042014102401 its reverse (1042014102402), we obtain a palindrome (999999999999).
The spelling of 2042014102401 in words is "two trillion, forty-two billion, fourteen million, one hundred two thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •