Base | Representation |
---|---|
bin | 11001111011000110011010… |
… | …110100000110100101001000 |
3 | 112221200111012110010202222110 |
4 | 121323012122310012211020 |
5 | 104420440102040101044 |
6 | 1042252342114422320 |
7 | 33005063065616532 |
oct | 3173063264064510 |
9 | 487614173122873 |
10 | 114012504222024 |
11 | 33367482373951 |
12 | 10954478b919a0 |
13 | 4b80443834425 |
14 | 202233dc32852 |
15 | d2aad833c6b9 |
hex | 67b19ad06948 |
114012504222024 has 16 divisors (see below), whose sum is σ = 285031260555120. Its totient is φ = 38004168074000.
The previous prime is 114012504221963. The next prime is 114012504222061. The reversal of 114012504222024 is 420222405210411.
It is a super-2 number, since 2×1140125042220242 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 114012504221982 and 114012504222000.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2375260504602 + ... + 2375260504649.
It is an arithmetic number, because the mean of its divisors is an integer number (17814453784695).
Almost surely, 2114012504222024 is an apocalyptic number.
It is an amenable number.
114012504222024 is an abundant number, since it is smaller than the sum of its proper divisors (171018756333096).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114012504222024 is a wasteful number, since it uses less digits than its factorization.
114012504222024 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4750521009260 (or 4750521009256 counting only the distinct ones).
The product of its (nonzero) digits is 10240, while the sum is 30.
Adding to 114012504222024 its reverse (420222405210411), we get a palindrome (534234909432435).
The spelling of 114012504222024 in words is "one hundred fourteen trillion, twelve billion, five hundred four million, two hundred twenty-two thousand, twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •