Base | Representation |
---|---|
bin | 11001111100011010001010… |
… | …001101101011000010111111 |
3 | 112222000002021211120212020022 |
4 | 121330122022031223002333 |
5 | 104423423224011304120 |
6 | 1042401532250242355 |
7 | 33014425223421344 |
oct | 3174321215530277 |
9 | 488002254525208 |
10 | 114102420025535 |
11 | 333a1623507967 |
12 | 109699917263bb |
13 | 4b88a730871a6 |
14 | 202682d8947cb |
15 | d2d0ec0d7025 |
hex | 67c68a36b0bf |
114102420025535 has 16 divisors (see below), whose sum is σ = 138240068371776. Its totient is φ = 90407773022208.
The previous prime is 114102420025487. The next prime is 114102420025679. The reversal of 114102420025535 is 535520024201411.
It is a cyclic number.
It is not a de Polignac number, because 114102420025535 - 230 = 114101346283711 is a prime.
It is a super-2 number, since 2×1141024200255352 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 114102420025495 and 114102420025504.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 246428642 + ... + 246891231.
It is an arithmetic number, because the mean of its divisors is an integer number (8640004273236).
Almost surely, 2114102420025535 is an apocalyptic number.
114102420025535 is a deficient number, since it is larger than the sum of its proper divisors (24137648346241).
114102420025535 is a wasteful number, since it uses less digits than its factorization.
114102420025535 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 493320322.
The product of its (nonzero) digits is 48000, while the sum is 35.
Adding to 114102420025535 its reverse (535520024201411), we get a palindrome (649622444226946).
The spelling of 114102420025535 in words is "one hundred fourteen trillion, one hundred two billion, four hundred twenty million, twenty-five thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •