Base | Representation |
---|---|
bin | 110101001110110011… |
… | …0000010010000101101 |
3 | 101221001200100100201202 |
4 | 1222131212002100231 |
5 | 3333103131041331 |
6 | 124303103215245 |
7 | 11154533454245 |
oct | 1523546022055 |
9 | 357050310652 |
10 | 114313143341 |
11 | 44530875591 |
12 | 1a1a32a7525 |
13 | aa19c6b927 |
14 | 5765d6cb25 |
15 | 2e90ac5ecb |
hex | 1a9d98242d |
114313143341 has 8 divisors (see below), whose sum is σ = 123396497280. Its totient is φ = 105572557552.
The previous prime is 114313143293. The next prime is 114313143379. The reversal of 114313143341 is 143341313411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 114313143341 - 214 = 114313126957 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114313143391) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 85691345 + ... + 85692678.
It is an arithmetic number, because the mean of its divisors is an integer number (15424562160).
Almost surely, 2114313143341 is an apocalyptic number.
It is an amenable number.
114313143341 is a deficient number, since it is larger than the sum of its proper divisors (9083353939).
114313143341 is a wasteful number, since it uses less digits than its factorization.
114313143341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 171384075.
The product of its digits is 5184, while the sum is 29.
Adding to 114313143341 its reverse (143341313411), we get a palindrome (257654456752).
The spelling of 114313143341 in words is "one hundred fourteen billion, three hundred thirteen million, one hundred forty-three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •