Base | Representation |
---|---|
bin | 1001001110010111011011… |
… | …1000001001000101101001 |
3 | 1022220121100010221022222021 |
4 | 2103211312320021011221 |
5 | 2312133130011332013 |
6 | 33323205421024441 |
7 | 2064523300242316 |
oct | 223456670110551 |
9 | 38817303838867 |
10 | 10142412214633 |
11 | 3260411312776 |
12 | 11798013b5121 |
13 | 58756b6c1a4a |
14 | 270c76c79d0d |
15 | 128c627eea8d |
hex | 93976e09169 |
10142412214633 has 4 divisors (see below), whose sum is σ = 10142423313748. Its totient is φ = 10142401115520.
The previous prime is 10142412214499. The next prime is 10142412214651. The reversal of 10142412214633 is 33641221424101.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 10079304243264 + 63107971369 = 3174792^2 + 251213^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10142412214633 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10142412914633) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4042416 + ... + 6051937.
It is an arithmetic number, because the mean of its divisors is an integer number (2535605828437).
Almost surely, 210142412214633 is an apocalyptic number.
It is an amenable number.
10142412214633 is a deficient number, since it is larger than the sum of its proper divisors (11099115).
10142412214633 is a wasteful number, since it uses less digits than its factorization.
10142412214633 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11099114.
The product of its (nonzero) digits is 27648, while the sum is 34.
Adding to 10142412214633 its reverse (33641221424101), we get a palindrome (43783633638734).
The spelling of 10142412214633 in words is "ten trillion, one hundred forty-two billion, four hundred twelve million, two hundred fourteen thousand, six hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •