Base | Representation |
---|---|
bin | 1001010010100011100111… |
… | …1110111110110101011101 |
3 | 1100011111011110010212101101 |
4 | 2110220321332332311131 |
5 | 2314323100142312001 |
6 | 33420233301113101 |
7 | 2102652323206663 |
oct | 224507176766535 |
9 | 40144143125341 |
10 | 10214405041501 |
11 | 32889a53a20a1 |
12 | 118b7536b8791 |
13 | 5912a297179b |
14 | 274546400c33 |
15 | 12aa77d57a01 |
hex | 94a39fbed5d |
10214405041501 has 8 divisors (see below), whose sum is σ = 10220149779840. Its totient is φ = 10208660937648.
The previous prime is 10214405041493. The next prime is 10214405041523. The reversal of 10214405041501 is 10514050441201.
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 10214405041501 - 23 = 10214405041493 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10214405041501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10214405041531) 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, 34117480 + ... + 34415566.
It is an arithmetic number, because the mean of its divisors is an integer number (1277518722480).
Almost surely, 210214405041501 is an apocalyptic number.
It is an amenable number.
10214405041501 is a deficient number, since it is larger than the sum of its proper divisors (5744738339).
10214405041501 is a wasteful number, since it uses less digits than its factorization.
10214405041501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 317243.
The product of its (nonzero) digits is 3200, while the sum is 28.
Adding to 10214405041501 its reverse (10514050441201), we get a palindrome (20728455482702).
The spelling of 10214405041501 in words is "ten trillion, two hundred fourteen billion, four hundred five million, forty-one thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.149 sec. • engine limits •