Base | Representation |
---|---|
bin | 110101010111011011… |
… | …1111010001111000011 |
3 | 101221210212211201120011 |
4 | 1222232313322033003 |
5 | 3334201334313411 |
6 | 124351540525351 |
7 | 11164653532123 |
oct | 1525667721703 |
9 | 357725751504 |
10 | 114603041731 |
11 | 4466a47a532 |
12 | 1a2643b0857 |
13 | aa65040839 |
14 | 5792672c83 |
15 | 2eab28bc21 |
hex | 1aaedfa3c3 |
114603041731 has 8 divisors (see below), whose sum is σ = 117290550960. Its totient is φ = 111916547232.
The previous prime is 114603041723. The next prime is 114603041767. The reversal of 114603041731 is 137140306411.
It is a happy number.
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 114603041731 - 23 = 114603041723 is a prime.
It is a super-2 number, since 2×1146030417312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 114603041693 and 114603041702.
It is not an unprimeable number, because it can be changed into a prime (114603041711) 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, 22720 + ... + 479293.
It is an arithmetic number, because the mean of its divisors is an integer number (14661318870).
Almost surely, 2114603041731 is an apocalyptic number.
114603041731 is a deficient number, since it is larger than the sum of its proper divisors (2687509229).
114603041731 is an equidigital number, since it uses as much as digits as its factorization.
114603041731 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 507365.
The product of its (nonzero) digits is 6048, while the sum is 31.
The spelling of 114603041731 in words is "one hundred fourteen billion, six hundred three million, forty-one thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •