Base | Representation |
---|---|
bin | 110101010111011100… |
… | …0111100111111001111 |
3 | 101221210220100121121211 |
4 | 1222232320330333033 |
5 | 3334201422041101 |
6 | 124351550435251 |
7 | 11164656051223 |
oct | 1525670747717 |
9 | 357726317554 |
10 | 114603315151 |
11 | 4466a6469a6 |
12 | 1a264502b27 |
13 | aa65108120 |
14 | 5792704783 |
15 | 2eab2e2c51 |
hex | 1aaee3cfcf |
114603315151 has 8 divisors (see below), whose sum is σ = 129914689520. Its totient is φ = 100219902912.
The previous prime is 114603315121. The next prime is 114603315161. The reversal of 114603315151 is 151513306411.
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 114603315151 - 27 = 114603315023 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (114603315121) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 231990270 + ... + 231990763.
It is an arithmetic number, because the mean of its divisors is an integer number (16239336190).
Almost surely, 2114603315151 is an apocalyptic number.
114603315151 is a deficient number, since it is larger than the sum of its proper divisors (15311374369).
114603315151 is a wasteful number, since it uses less digits than its factorization.
114603315151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 463981065.
The product of its (nonzero) digits is 5400, while the sum is 31.
The spelling of 114603315151 in words is "one hundred fourteen billion, six hundred three million, three hundred fifteen thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •