Base | Representation |
---|---|
bin | 1001001110010111011011… |
… | …1000001000010100000101 |
3 | 1022220121100010221011121210 |
4 | 2103211312320020110011 |
5 | 2312133130011231321 |
6 | 33323205421002033 |
7 | 2064523300230135 |
oct | 223456670102405 |
9 | 38817303834553 |
10 | 10142412211461 |
11 | 3260411310352 |
12 | 11798013b3319 |
13 | 58756b6c047a |
14 | 270c76c78ac5 |
15 | 128c627edb76 |
hex | 93976e08505 |
10142412211461 has 8 divisors (see below), whose sum is σ = 13523284474624. Its totient is φ = 6761574044640.
The previous prime is 10142412211429. The next prime is 10142412211489. The reversal of 10142412211461 is 16411221424101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10142412211461 - 25 = 10142412211429 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 (10142412211411) 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 7 ways as a sum of consecutive naturals, for example, 7821736 + ... + 9025761.
It is an arithmetic number, because the mean of its divisors is an integer number (1690410559328).
Almost surely, 210142412211461 is an apocalyptic number.
It is an amenable number.
10142412211461 is a deficient number, since it is larger than the sum of its proper divisors (3380872263163).
10142412211461 is a wasteful number, since it uses less digits than its factorization.
10142412211461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17048171.
The product of its (nonzero) digits is 3072, while the sum is 30.
Adding to 10142412211461 its reverse (16411221424101), we get a palindrome (26553633635562).
The spelling of 10142412211461 in words is "ten trillion, one hundred forty-two billion, four hundred twelve million, two hundred eleven thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •