Base | Representation |
---|---|
bin | 1010010110001101101111… |
… | …1111011100010000000010 |
3 | 1111021121102021001012000210 |
4 | 2211203123333130100002 |
5 | 2442344103121202043 |
6 | 40110225140454550 |
7 | 2252641552324410 |
oct | 245433377342002 |
9 | 44247367035023 |
10 | 11376764240898 |
11 | 3696949905611 |
12 | 1338a873aa456 |
13 | 646a93ba87c4 |
14 | 2b48d17da2b0 |
15 | 14ae08223633 |
hex | a58dbfdc402 |
11376764240898 has 32 divisors (see below), whose sum is σ = 26430328172160. Its totient is φ = 3197217116160.
The previous prime is 11376764240893. The next prime is 11376764240917. The reversal of 11376764240898 is 89804246767311.
11376764240898 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Smith number, since the sum of its digits (66) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (11376764240893) 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, 2220287103 + ... + 2220292226.
It is an arithmetic number, because the mean of its divisors is an integer number (825947755380).
Almost surely, 211376764240898 is an apocalyptic number.
11376764240898 is an abundant number, since it is smaller than the sum of its proper divisors (15053563931262).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11376764240898 is a wasteful number, since it uses less digits than its factorization.
11376764240898 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4440579402.
The product of its (nonzero) digits is 97542144, while the sum is 66.
The spelling of 11376764240898 in words is "eleven trillion, three hundred seventy-six billion, seven hundred sixty-four million, two hundred forty thousand, eight hundred ninety-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •