Base | Representation |
---|---|
bin | 11010000011111011001000… |
… | …101000010110010010110100 |
3 | 120000211110022122200111220210 |
4 | 122003323020220112102310 |
5 | 110010403413000000312 |
6 | 1043435102345425420 |
7 | 33066640165601214 |
oct | 3203731050262264 |
9 | 500743278614823 |
10 | 114618863281332 |
11 | 3358065023a863 |
12 | 10a31aa149b270 |
13 | 4bc5687a66207 |
14 | 2043822870244 |
15 | d3b7765bae3c |
hex | 683ec8a164b4 |
114618863281332 has 96 divisors (see below), whose sum is σ = 283420828656000. Its totient is φ = 35988257536000.
The previous prime is 114618863281319. The next prime is 114618863281343. The reversal of 114618863281332 is 233182368816411.
It is a happy number.
114618863281332 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
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, 928770832 + ... + 928894232.
It is an arithmetic number, because the mean of its divisors is an integer number (2952300298500).
Almost surely, 2114618863281332 is an apocalyptic number.
114618863281332 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
114618863281332 is an abundant number, since it is smaller than the sum of its proper divisors (168801965374668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114618863281332 is a wasteful number, since it uses less digits than its factorization.
114618863281332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 188577 (or 188575 counting only the distinct ones).
The product of its digits is 7962624, while the sum is 57.
The spelling of 114618863281332 in words is "one hundred fourteen trillion, six hundred eighteen billion, eight hundred sixty-three million, two hundred eighty-one thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •