Base | Representation |
---|---|
bin | 110101010100011011… |
… | …0110111000100110111 |
3 | 101221112211220112010122 |
4 | 1222220312313010313 |
5 | 3334000014301401 |
6 | 124333533242155 |
7 | 11162316551126 |
oct | 1525066670467 |
9 | 357484815118 |
10 | 114502103351 |
11 | 446184a7a89 |
12 | 1a23663335b |
13 | aa4a15bb9c |
14 | 57830b9abd |
15 | 2ea249e21b |
hex | 1aa8db7137 |
114502103351 has 4 divisors (see below), whose sum is σ = 116114809104. Its totient is φ = 112889397600.
The previous prime is 114502103333. The next prime is 114502103357. The reversal of 114502103351 is 153301205411.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-114502103351 is a prime.
It is a super-2 number, since 2×1145021033512 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 114502103351.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114502103357) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 806352770 + ... + 806352911.
It is an arithmetic number, because the mean of its divisors is an integer number (29028702276).
Almost surely, 2114502103351 is an apocalyptic number.
114502103351 is a deficient number, since it is larger than the sum of its proper divisors (1612705753).
114502103351 is an equidigital number, since it uses as much as digits as its factorization.
114502103351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1612705752.
The product of its (nonzero) digits is 1800, while the sum is 26.
Adding to 114502103351 its reverse (153301205411), we get a palindrome (267803308762).
The spelling of 114502103351 in words is "one hundred fourteen billion, five hundred two million, one hundred three thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •