Base | Representation |
---|---|
bin | 110101100000001000… |
… | …1100000010100010110 |
3 | 101222120020010220121200 |
4 | 1223000101200110112 |
5 | 3340301102321430 |
6 | 124440525453330 |
7 | 11205130036332 |
oct | 1530021402426 |
9 | 358506126550 |
10 | 114894963990 |
11 | 447aa236aa4 |
12 | 1a326111246 |
13 | aab06709c1 |
14 | 57bd3427c2 |
15 | 2ec6c02460 |
hex | 1ac0460516 |
114894963990 has 48 divisors (see below), whose sum is σ = 309027841200. Its totient is φ = 29582150976.
The previous prime is 114894963917. The next prime is 114894964027. The reversal of 114894963990 is 99369498411.
114894963990 is a `hidden beast` number, since 1 + 1 + 489 + 4 + 9 + 63 + 9 + 90 = 666.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 22007920 + ... + 22013139.
It is an arithmetic number, because the mean of its divisors is an integer number (6438080025).
Almost surely, 2114894963990 is an apocalyptic number.
114894963990 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
114894963990 is an abundant number, since it is smaller than the sum of its proper divisors (194132877210).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114894963990 is a wasteful number, since it uses less digits than its factorization.
114894963990 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44021101 (or 44021098 counting only the distinct ones).
The product of its (nonzero) digits is 15116544, while the sum is 63.
The spelling of 114894963990 in words is "one hundred fourteen billion, eight hundred ninety-four million, nine hundred sixty-three thousand, nine hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •