Base | Representation |
---|---|
bin | 11001111011100000010101… |
… | …011110110001110011010001 |
3 | 112221210011000211002001111212 |
4 | 121323200111132301303101 |
5 | 104421414100000030413 |
6 | 1042313223313145505 |
7 | 33010066511250464 |
oct | 3173402536616321 |
9 | 487704024061455 |
10 | 114040332033233 |
11 | 33378262453331 |
12 | 1095994455b295 |
13 | 4b82c59b847c8 |
14 | 202381d99d2db |
15 | d2b6b63deca8 |
hex | 67b8157b1cd1 |
114040332033233 has 16 divisors (see below), whose sum is σ = 115736980801536. Its totient is φ = 112346208409680.
The previous prime is 114040332033169. The next prime is 114040332033247. The reversal of 114040332033233 is 332330233040411.
It is a cyclic number.
It is not a de Polignac number, because 114040332033233 - 26 = 114040332033169 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 114040332033233.
It is not an unprimeable number, because it can be changed into a prime (114040332053233) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1534351010 + ... + 1534425332.
It is an arithmetic number, because the mean of its divisors is an integer number (7233561300096).
Almost surely, 2114040332033233 is an apocalyptic number.
It is an amenable number.
114040332033233 is a deficient number, since it is larger than the sum of its proper divisors (1696648768303).
114040332033233 is a wasteful number, since it uses less digits than its factorization.
114040332033233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91004.
The product of its (nonzero) digits is 46656, while the sum is 32.
Adding to 114040332033233 its reverse (332330233040411), we get a palindrome (446370565073644).
The spelling of 114040332033233 in words is "one hundred fourteen trillion, forty billion, three hundred thirty-two million, thirty-three thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •