Base | Representation |
---|---|
bin | 11001111111100000001111… |
… | …001011111111111011110001 |
3 | 112222202102021011200012022002 |
4 | 121333200033023333323301 |
5 | 104440414313203312113 |
6 | 1043043344533423345 |
7 | 33035664565403042 |
oct | 3177401713777361 |
9 | 488672234605262 |
10 | 114315104354033 |
11 | 33473844245880 |
12 | 109a304919ab55 |
13 | 4ba2b3925108b |
14 | 2032c4840c8c9 |
15 | d338e8e05c58 |
hex | 67f80f2ffef1 |
114315104354033 has 24 divisors (see below), whose sum is σ = 127679329625760. Its totient is φ = 101502573500160.
The previous prime is 114315104353999. The next prime is 114315104354083. The reversal of 114315104354033 is 330453401513411.
It is not a de Polignac number, because 114315104354033 - 28 = 114315104353777 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (114315104354083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 742764353 + ... + 742918241.
It is an arithmetic number, because the mean of its divisors is an integer number (5319972067740).
Almost surely, 2114315104354033 is an apocalyptic number.
It is an amenable number.
114315104354033 is a deficient number, since it is larger than the sum of its proper divisors (13364225271727).
114315104354033 is a wasteful number, since it uses less digits than its factorization.
114315104354033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 190509 (or 190466 counting only the distinct ones).
The product of its (nonzero) digits is 129600, while the sum is 38.
Adding to 114315104354033 its reverse (330453401513411), we get a palindrome (444768505867444).
The spelling of 114315104354033 in words is "one hundred fourteen trillion, three hundred fifteen billion, one hundred four million, three hundred fifty-four thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •