Base | Representation |
---|---|
bin | 110110001010011011… |
… | …1100000001101000110 |
3 | 102010020010201010201000 |
4 | 1230110313200031012 |
5 | 3401202414224032 |
6 | 125233425114130 |
7 | 11255242324203 |
oct | 1542467401506 |
9 | 363203633630 |
10 | 116314211142 |
11 | 45368381428 |
12 | 1a661488946 |
13 | ac786cb00c |
14 | 58b5a24caa |
15 | 305b5e9e7c |
hex | 1b14de0346 |
116314211142 has 16 divisors (see below), whose sum is σ = 258476024880. Its totient is φ = 38771403696.
The previous prime is 116314211141. The next prime is 116314211203. The reversal of 116314211142 is 241112413611.
It is a happy number.
116314211142 is a `hidden beast` number, since 1 + 1 + 631 + 4 + 2 + 11 + 14 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (116314211141) 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, 1076983383 + ... + 1076983490.
It is an arithmetic number, because the mean of its divisors is an integer number (16154751555).
Almost surely, 2116314211142 is an apocalyptic number.
116314211142 is an abundant number, since it is smaller than the sum of its proper divisors (142161813738).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
116314211142 is a wasteful number, since it uses less digits than its factorization.
116314211142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2153966884 (or 2153966878 counting only the distinct ones).
The product of its digits is 1152, while the sum is 27.
Adding to 116314211142 its reverse (241112413611), we get a palindrome (357426624753).
The spelling of 116314211142 in words is "one hundred sixteen billion, three hundred fourteen million, two hundred eleven thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •