Base | Representation |
---|---|
bin | 11001111011000111110100… |
… | …111000001110101000101001 |
3 | 112221200122002202102002211220 |
4 | 121323013310320032220221 |
5 | 104421001200401044113 |
6 | 1042253152053212253 |
7 | 33005145404310000 |
oct | 3173076470165051 |
9 | 487618082362756 |
10 | 114014015253033 |
11 | 333680882a8905 |
12 | 1095481b031089 |
13 | 4b806248b960c |
14 | 20224447a7c37 |
15 | d2ab75d15523 |
hex | 67b1f4e0ea29 |
114014015253033 has 40 divisors (see below), whose sum is σ = 177435596832000. Its totient is φ = 65117429997984.
The previous prime is 114014015252989. The next prime is 114014015253041. The reversal of 114014015253033 is 330352510410411.
It is not a de Polignac number, because 114014015253033 - 212 = 114014015248937 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 114014015252985 and 114014015253003.
It is not an unprimeable number, because it can be changed into a prime (114014015253433) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 9977928 + ... + 18099366.
It is an arithmetic number, because the mean of its divisors is an integer number (4435889920800).
Almost surely, 2114014015253033 is an apocalyptic number.
It is an amenable number.
114014015253033 is a deficient number, since it is larger than the sum of its proper divisors (63421581578967).
114014015253033 is an frugal number, since it uses more digits than its factorization.
114014015253033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8123419 (or 8123398 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 33.
Adding to 114014015253033 its reverse (330352510410411), we get a palindrome (444366525663444).
The spelling of 114014015253033 in words is "one hundred fourteen trillion, fourteen billion, fifteen million, two hundred fifty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •