Base | Representation |
---|---|
bin | 110101001011110010… |
… | …0011101010101011100 |
3 | 101220210122011010120200 |
4 | 1222113210131111130 |
5 | 3332401242113102 |
6 | 124245052543500 |
7 | 11152165356105 |
oct | 1522744352534 |
9 | 356718133520 |
10 | 114212066652 |
11 | 44489809132 |
12 | 1a175481b90 |
13 | aa0203c038 |
14 | 575677b3ac |
15 | 2e86cac51c |
hex | 1a9791d55c |
114212066652 has 18 divisors (see below), whose sum is σ = 288702724128. Its totient is φ = 38070688872.
The previous prime is 114212066651. The next prime is 114212066659. The reversal of 114212066652 is 256660212411.
It is a tau number, because it is divible by the number of its divisors (18).
It is a Harshad number since it is a multiple of its sum of digits (36), and also a Moran number because the ratio is a prime number: 3172557407 = 114212066652 / (1 + 1 + 4 + 2 + 1 + 2 + 0 + 6 + 6 + 6 + 5 + 2).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114212066651) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1586278668 + ... + 1586278739.
Almost surely, 2114212066652 is an apocalyptic number.
114212066652 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
114212066652 is an abundant number, since it is smaller than the sum of its proper divisors (174490657476).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114212066652 is a wasteful number, since it uses less digits than its factorization.
114212066652 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3172557417 (or 3172557412 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 36.
The spelling of 114212066652 in words is "one hundred fourteen billion, two hundred twelve million, sixty-six thousand, six hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •