Base | Representation |
---|---|
bin | 110101011100010011… |
… | …0100000010001000000 |
3 | 101222020020221121200120 |
4 | 1222320212200101000 |
5 | 3340020130013242 |
6 | 124420051020240 |
7 | 11202005016114 |
oct | 1527046402100 |
9 | 358206847616 |
10 | 114766251072 |
11 | 44743614090 |
12 | 1a2aab9a680 |
13 | aa8cab6005 |
14 | 57aa1d9744 |
15 | 2eba77a1ec |
hex | 1ab89a0440 |
114766251072 has 112 divisors (see below), whose sum is σ = 336687956544. Its totient is φ = 34207488000.
The previous prime is 114766251059. The next prime is 114766251073. The reversal of 114766251072 is 270152667411.
It is a super-2 number, since 2×1147662510722 (a number of 23 digits) contains 22 as substring.
It is a hoax number, since the sum of its digits (42) coincides with the sum of the digits of its distinct prime factors.
It is not an unprimeable number, because it can be changed into a prime (114766251073) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 316579 + ... + 574242.
Almost surely, 2114766251072 is an apocalyptic number.
114766251072 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
114766251072 is an abundant number, since it is smaller than the sum of its proper divisors (221921705472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114766251072 is a wasteful number, since it uses less digits than its factorization.
114766251072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 890908 (or 890898 counting only the distinct ones).
The product of its (nonzero) digits is 141120, while the sum is 42.
The spelling of 114766251072 in words is "one hundred fourteen billion, seven hundred sixty-six million, two hundred fifty-one thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •