Base | Representation |
---|---|
bin | 101110100100110010101… |
… | …0101101011000000000101 |
3 | 211122221121201211221211201 |
4 | 1131021211111223000011 |
5 | 1314334130032413023 |
6 | 21340401002302501 |
7 | 1230320511402625 |
oct | 135114525530005 |
9 | 24587551757751 |
10 | 6401201451013 |
11 | 2048809381776 |
12 | 8747194b7a31 |
13 | 37582787cba5 |
14 | 181b6977c885 |
15 | b179b0a6bad |
hex | 5d26556b005 |
6401201451013 has 16 divisors (see below), whose sum is σ = 6775883150400. Its totient is φ = 6030302826240.
The previous prime is 6401201450999. The next prime is 6401201451077. The reversal of 6401201451013 is 3101541021046.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-6401201451013 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6401201451313) 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 15 ways as a sum of consecutive naturals, for example, 46540098 + ... + 46677436.
It is an arithmetic number, because the mean of its divisors is an integer number (423492696900).
Almost surely, 26401201451013 is an apocalyptic number.
It is an amenable number.
6401201451013 is a deficient number, since it is larger than the sum of its proper divisors (374681699387).
6401201451013 is a wasteful number, since it uses less digits than its factorization.
6401201451013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 151092.
The product of its (nonzero) digits is 2880, while the sum is 28.
Adding to 6401201451013 its reverse (3101541021046), we get a palindrome (9502742472059).
The spelling of 6401201451013 in words is "six trillion, four hundred one billion, two hundred one million, four hundred fifty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •