Base | Representation |
---|---|
bin | 110101011011001110… |
… | …1100110010011110111 |
3 | 101222010202102021021111 |
4 | 1222312131212103313 |
5 | 3334431433041403 |
6 | 124412325455451 |
7 | 11201060662420 |
oct | 1526635462367 |
9 | 358122367244 |
10 | 114730362103 |
11 | 44725331185 |
12 | 1a29ab71587 |
13 | aa8552b736 |
14 | 57a5536647 |
15 | 2eb753b56d |
hex | 1ab67664f7 |
114730362103 has 8 divisors (see below), whose sum is σ = 132967180800. Its totient is φ = 96955235160.
The previous prime is 114730362083. The next prime is 114730362119. The reversal of 114730362103 is 301263037411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 114730362103 - 29 = 114730361591 is a prime.
It is a super-3 number, since 3×1147303621033 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114730360103) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 115422403 + ... + 115423396.
It is an arithmetic number, because the mean of its divisors is an integer number (16620897600).
Almost surely, 2114730362103 is an apocalyptic number.
114730362103 is a deficient number, since it is larger than the sum of its proper divisors (18236818697).
114730362103 is an equidigital number, since it uses as much as digits as its factorization.
114730362103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 230845877.
The product of its (nonzero) digits is 9072, while the sum is 31.
Adding to 114730362103 its reverse (301263037411), we get a palindrome (415993399514).
The spelling of 114730362103 in words is "one hundred fourteen billion, seven hundred thirty million, three hundred sixty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •