Base | Representation |
---|---|
bin | 110110010010111010… |
… | …1111001010000100111 |
3 | 102010221222121000112011 |
4 | 1230211311321100213 |
5 | 3402243321032101 |
6 | 125322001135051 |
7 | 11265301110532 |
oct | 1544565712047 |
9 | 363858530464 |
10 | 116599002151 |
11 | 454a41080a5 |
12 | 1a72092a487 |
13 | acc27022c8 |
14 | 5901799a19 |
15 | 3076602751 |
hex | 1b25d79427 |
116599002151 has 4 divisors (see below), whose sum is σ = 119079832032. Its totient is φ = 114118172272.
The previous prime is 116599002137. The next prime is 116599002197. The reversal of 116599002151 is 151200995611.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 151200995611 = 239 ⋅632640149.
It is a cyclic number.
It is not a de Polignac number, because 116599002151 - 211 = 116599000103 is a prime.
It is a super-3 number, since 3×1165990021513 (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 (116599002851) 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, 1240414870 + ... + 1240414963.
It is an arithmetic number, because the mean of its divisors is an integer number (29769958008).
Almost surely, 2116599002151 is an apocalyptic number.
116599002151 is a deficient number, since it is larger than the sum of its proper divisors (2480829881).
116599002151 is an equidigital number, since it uses as much as digits as its factorization.
116599002151 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2480829880.
The product of its (nonzero) digits is 24300, while the sum is 40.
Adding to 116599002151 its reverse (151200995611), we get a palindrome (267799997762).
The spelling of 116599002151 in words is "one hundred sixteen billion, five hundred ninety-nine million, two thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •