Base | Representation |
---|---|
bin | 110110011011111111… |
… | …0000011101100010001 |
3 | 102011202011212102010201 |
4 | 1230313332003230101 |
5 | 3403404200210141 |
6 | 125412103455201 |
7 | 11305653140332 |
oct | 1546776035421 |
9 | 364664772121 |
10 | 116903131921 |
11 | 4563a852314 |
12 | 1a7a6757501 |
13 | b040717a54 |
14 | 592dd26289 |
15 | 309317a031 |
hex | 1b37f83b11 |
116903131921 has 3 divisors (see below), whose sum is σ = 116903473833. Its totient is φ = 116902790010.
The previous prime is 116903131909. The next prime is 116903131937. The reversal of 116903131921 is 129131309611.
The square root of 116903131921 is 341911.
It is a perfect power (a square), and thus also a powerful number.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is not a de Polignac number, because 116903131921 - 29 = 116903131409 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (116903131981) by changing a digit.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 170956 + ... + 512866.
It is an arithmetic number, because the mean of its divisors is an integer number (38967824611).
Almost surely, 2116903131921 is an apocalyptic number.
116903131921 is the 341911-st square number.
116903131921 is the 170956-th centered octagonal number.
It is an amenable number.
116903131921 is a deficient number, since it is larger than the sum of its proper divisors (341912).
116903131921 is an frugal number, since it uses more digits than its factorization.
116903131921 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 683822 (or 341911 counting only the distinct ones).
The product of its (nonzero) digits is 8748, while the sum is 37.
The spelling of 116903131921 in words is "one hundred sixteen billion, nine hundred three million, one hundred thirty-one thousand, nine hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •