Base | Representation |
---|---|
bin | 110101001111010101… |
… | …0101100010010110100 |
3 | 101221002221012202021211 |
4 | 1222132222230102310 |
5 | 3333122233010200 |
6 | 124304545051204 |
7 | 11155142444365 |
oct | 1523652542264 |
9 | 357087182254 |
10 | 114331141300 |
11 | 4453aa48732 |
12 | 1a1a9326b04 |
13 | aa209009cc |
14 | 57684d5b6c |
15 | 2e9247daba |
hex | 1a9eaac4b4 |
114331141300 has 18 divisors (see below), whose sum is σ = 248098576838. Its totient is φ = 45732456480.
The previous prime is 114331141297. The next prime is 114331141307. The reversal of 114331141300 is 3141133411.
It can be written as a sum of positive squares in 3 ways, for example, as 17114395684 + 97216745616 = 130822^2 + 311796^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114331141307) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 571655607 + ... + 571655806.
Almost surely, 2114331141300 is an apocalyptic number.
114331141300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
114331141300 is an abundant number, since it is smaller than the sum of its proper divisors (133767435538).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114331141300 is a wasteful number, since it uses less digits than its factorization.
114331141300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1143311427 (or 1143311420 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 114331141300 its reverse (3141133411), we get a palindrome (117472274711).
The spelling of 114331141300 in words is "one hundred fourteen billion, three hundred thirty-one million, one hundred forty-one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •