Base | Representation |
---|---|
bin | 1010100100000001101001… |
… | …1000101000000101010000 |
3 | 1112010021212000101120100101 |
4 | 2221000122120220011100 |
5 | 3010241020230403012 |
6 | 40411225204102144 |
7 | 2306041411061500 |
oct | 251003230500520 |
9 | 45107760346311 |
10 | 11614034231632 |
11 | 3778536601448 |
12 | 1376a64694954 |
13 | 6632777b7521 |
14 | 2c219d683a00 |
15 | 15219366cd57 |
hex | a901a628150 |
11614034231632 has 60 divisors (see below), whose sum is σ = 26285541992640. Its totient is φ = 4956617039808.
The previous prime is 11614034231593. The next prime is 11614034231671. The reversal of 11614034231632 is 23613243041611.
It is an interprime number because it is at equal distance from previous prime (11614034231593) and next prime (11614034231671).
It is a super-2 number, since 2×116140342316322 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11614034231591 and 11614034231600.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 30803878 + ... + 31178629.
It is an arithmetic number, because the mean of its divisors is an integer number (438092366544).
Almost surely, 211614034231632 is an apocalyptic number.
It is an amenable number.
11614034231632 is an abundant number, since it is smaller than the sum of its proper divisors (14671507761008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11614034231632 is a wasteful number, since it uses less digits than its factorization.
11614034231632 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 61982768 (or 61982755 counting only the distinct ones).
The product of its (nonzero) digits is 62208, while the sum is 37.
The spelling of 11614034231632 in words is "eleven trillion, six hundred fourteen billion, thirty-four million, two hundred thirty-one thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •