Base | Representation |
---|---|
bin | 111101010010101111011… |
… | …011010110110010010111 |
3 | 112220122221022001012220012 |
4 | 331102233123112302113 |
5 | 1023002144322242403 |
6 | 12542545440230435 |
7 | 613210363625603 |
oct | 75225733266227 |
9 | 15818838035805 |
10 | 4212011134103 |
11 | 1384338529683 |
12 | 58039600b41b |
13 | 24726367a246 |
14 | 107c106da503 |
15 | 7486db4ded8 |
hex | 3d4af6d6c97 |
4212011134103 has 4 divisors (see below), whose sum is σ = 4228792055208. Its totient is φ = 4195230213000.
The previous prime is 4212011134081. The next prime is 4212011134153. The reversal of 4212011134103 is 3014311102124.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 4212011134103 - 214 = 4212011117719 is a prime.
It is a super-6 number, since 6×42120111341036 (a number of 77 digits) contains 666666 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4212011134153) 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, 8390460176 + ... + 8390460677.
It is an arithmetic number, because the mean of its divisors is an integer number (1057198013802).
Almost surely, 24212011134103 is an apocalyptic number.
4212011134103 is a deficient number, since it is larger than the sum of its proper divisors (16780921105).
4212011134103 is a wasteful number, since it uses less digits than its factorization.
4212011134103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16780921104.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 4212011134103 its reverse (3014311102124), we get a palindrome (7226322236227).
The spelling of 4212011134103 in words is "four trillion, two hundred twelve billion, eleven million, one hundred thirty-four thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •