Base | Representation |
---|---|
bin | 110101001111101011… |
… | …0101011010101111100 |
3 | 101221010201220120002011 |
4 | 1222133112223111330 |
5 | 3333133210443430 |
6 | 124310040141004 |
7 | 11155342450003 |
oct | 1523726532574 |
9 | 357121816064 |
10 | 114342671740 |
11 | 44546503720 |
12 | 1a1b1167764 |
13 | aa2310a05b |
14 | 5769c57c3a |
15 | 2e934aa22a |
hex | 1a9f5ab57c |
114342671740 has 48 divisors (see below), whose sum is σ = 261971982720. Its totient is φ = 41575452480.
The previous prime is 114342671731. The next prime is 114342671791. The reversal of 114342671740 is 47176243411.
It is a junction number, because it is equal to n+sod(n) for n = 114342671693 and 114342671702.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4214659 + ... + 4241701.
It is an arithmetic number, because the mean of its divisors is an integer number (5457749640).
Almost surely, 2114342671740 is an apocalyptic number.
114342671740 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
114342671740 is an abundant number, since it is smaller than the sum of its proper divisors (147629310980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
114342671740 is a wasteful number, since it uses less digits than its factorization.
114342671740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46282 (or 46280 counting only the distinct ones).
The product of its (nonzero) digits is 112896, while the sum is 40.
It can be divided in two parts, 114342671 and 740, that added together give a palindrome (114343411).
The spelling of 114342671740 in words is "one hundred fourteen billion, three hundred forty-two million, six hundred seventy-one thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •