Base | Representation |
---|---|
bin | 11010000010011000110000… |
… | …101101001100111111011011 |
3 | 120000110100200020211010020211 |
4 | 122002120300231030333123 |
5 | 110002141101202431021 |
6 | 1043314353133231551 |
7 | 33056210502000202 |
oct | 3202306055147733 |
9 | 500410606733224 |
10 | 114513235202011 |
11 | 3353a876a10438 |
12 | 10a155229325b7 |
13 | 4bb872324a629 |
14 | 203c682176239 |
15 | d38b432123e1 |
hex | 682630b4cfdb |
114513235202011 has 4 divisors (see below), whose sum is σ = 114548699198800. Its totient is φ = 114477771205224.
The previous prime is 114513235201979. The next prime is 114513235202017. The reversal of 114513235202011 is 110202532315411.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 114513235202011 - 25 = 114513235201979 is a prime.
It is a super-2 number, since 2×1145132352020112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (114513235202017) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17731993551 + ... + 17732000008.
It is an arithmetic number, because the mean of its divisors is an integer number (28637174799700).
Almost surely, 2114513235202011 is an apocalyptic number.
114513235202011 is a deficient number, since it is larger than the sum of its proper divisors (35463996789).
114513235202011 is an equidigital number, since it uses as much as digits as its factorization.
114513235202011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35463996788.
The product of its (nonzero) digits is 7200, while the sum is 31.
Adding to 114513235202011 its reverse (110202532315411), we get a palindrome (224715767517422).
The spelling of 114513235202011 in words is "one hundred fourteen trillion, five hundred thirteen billion, two hundred thirty-five million, two hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •