Base | Representation |
---|---|
bin | 11010011000100000010001… |
… | …001110001100001010110000 |
3 | 120012211122210000101001220210 |
4 | 122120200101032030022300 |
5 | 110202041320100320024 |
6 | 1050440514255104120 |
7 | 33304055005350651 |
oct | 3230402116141260 |
9 | 505748700331823 |
10 | 116033125401264 |
11 | 33a76410347925 |
12 | 1101bbb6b12040 |
13 | 4c98b523760b6 |
14 | 20920672a5528 |
15 | d6344b889129 |
hex | 69881138c2b0 |
116033125401264 has 80 divisors (see below), whose sum is σ = 310126201233120. Its totient is φ = 37339457003520.
The previous prime is 116033125401257. The next prime is 116033125401269. The reversal of 116033125401264 is 462104521330611.
It is not an unprimeable number, because it can be changed into a prime (116033125401269) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6405984 + ... + 16525824.
It is an arithmetic number, because the mean of its divisors is an integer number (3876577515414).
Almost surely, 2116033125401264 is an apocalyptic number.
It is an amenable number.
116033125401264 is an abundant number, since it is smaller than the sum of its proper divisors (194093075831856).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116033125401264 is a wasteful number, since it uses less digits than its factorization.
116033125401264 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10128118 (or 10128112 counting only the distinct ones).
The product of its (nonzero) digits is 103680, while the sum is 39.
Adding to 116033125401264 its reverse (462104521330611), we get a palindrome (578137646731875).
The spelling of 116033125401264 in words is "one hundred sixteen trillion, thirty-three billion, one hundred twenty-five million, four hundred one thousand, two hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •