Base | Representation |
---|---|
bin | 11001111100011010101110… |
… | …110100100100111111100011 |
3 | 112222000010212122021100212201 |
4 | 121330122232310210333203 |
5 | 104423431003224013011 |
6 | 1042402113230234031 |
7 | 33014446362022450 |
oct | 3174325664447743 |
9 | 488003778240781 |
10 | 114103034204131 |
11 | 333a190916a385 |
12 | 10969b23355917 |
13 | 4b88b403a858b |
14 | 202688b28c827 |
15 | d2d135ea5cc1 |
hex | 67c6aed24fe3 |
114103034204131 has 32 divisors (see below), whose sum is σ = 138992518909440. Its totient is φ = 91491396079104.
The previous prime is 114103034203997. The next prime is 114103034204167. The reversal of 114103034204131 is 131402430301411.
It is not a de Polignac number, because 114103034204131 - 217 = 114103034073059 is a prime.
It is a super-2 number, since 2×1141030342041312 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 114103034204131.
It is not an unprimeable number, because it can be changed into a prime (114103034204431) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 18664731 + ... + 24012043.
It is an arithmetic number, because the mean of its divisors is an integer number (4343516215920).
Almost surely, 2114103034204131 is an apocalyptic number.
114103034204131 is a deficient number, since it is larger than the sum of its proper divisors (24889484705309).
114103034204131 is a wasteful number, since it uses less digits than its factorization.
114103034204131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5349355.
The product of its (nonzero) digits is 3456, while the sum is 28.
Adding to 114103034204131 its reverse (131402430301411), we get a palindrome (245505464505542).
The spelling of 114103034204131 in words is "one hundred fourteen trillion, one hundred three billion, thirty-four million, two hundred four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •