Base | Representation |
---|---|
bin | 11001111100100001010000… |
… | …000110111011010100100100 |
3 | 112222000210221112201101202010 |
4 | 121330201100012323110210 |
5 | 104424034322442111002 |
6 | 1042405232040114220 |
7 | 33015115021536303 |
oct | 3174412006732444 |
9 | 488023845641663 |
10 | 114110035113252 |
11 | 333a4880a84a92 |
12 | 1096b357a65970 |
13 | 4b896b793c259 |
14 | 2026d52da443a |
15 | d2d3e58ee46c |
hex | 67c8501bb524 |
114110035113252 has 96 divisors (see below), whose sum is σ = 276403048072704. Its totient is φ = 36613985126400.
The previous prime is 114110035113233. The next prime is 114110035113337. The reversal of 114110035113252 is 252311530011411.
It is a super-2 number, since 2×1141100351132522 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 422380488 + ... + 422650560.
It is an arithmetic number, because the mean of its divisors is an integer number (2879198417424).
Almost surely, 2114110035113252 is an apocalyptic number.
114110035113252 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
114110035113252 is an abundant number, since it is smaller than the sum of its proper divisors (162293012959452).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114110035113252 is a wasteful number, since it uses less digits than its factorization.
114110035113252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 282469 (or 282467 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 30.
Adding to 114110035113252 its reverse (252311530011411), we get a palindrome (366421565124663).
The spelling of 114110035113252 in words is "one hundred fourteen trillion, one hundred ten billion, thirty-five million, one hundred thirteen thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •