Base | Representation |
---|---|
bin | 110101000110011101… |
… | …0110000101001101000 |
3 | 101220100011220002000122 |
4 | 1222030322300221220 |
5 | 3332020020113220 |
6 | 124215230422412 |
7 | 11144565411614 |
oct | 1521472605150 |
9 | 356304802018 |
10 | 114033363560 |
11 | 443a7951926 |
12 | 1a125661a08 |
13 | a9a400056c |
14 | 573ab40344 |
15 | 2e7625d425 |
hex | 1a8ceb0a68 |
114033363560 has 16 divisors (see below), whose sum is σ = 256575068100. Its totient is φ = 45613345408.
The previous prime is 114033363551. The next prime is 114033363641. The reversal of 114033363560 is 65363330411.
It can be written as a sum of positive squares in 2 ways, for example, as 105678306724 + 8355056836 = 325082^2 + 91406^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 114033363560.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 1425417005 + ... + 1425417084.
Almost surely, 2114033363560 is an apocalyptic number.
114033363560 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
114033363560 is an abundant number, since it is smaller than the sum of its proper divisors (142541704540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114033363560 is a wasteful number, since it uses less digits than its factorization.
114033363560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2850834100 (or 2850834096 counting only the distinct ones).
The product of its (nonzero) digits is 58320, while the sum is 35.
Adding to 114033363560 its reverse (65363330411), we get a palindrome (179396693971).
The spelling of 114033363560 in words is "one hundred fourteen billion, thirty-three million, three hundred sixty-three thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •