Base | Representation |
---|---|
bin | 111000110001001110… |
… | …0011000010111110011 |
3 | 102122200011110210020110 |
4 | 1301202130120113303 |
5 | 3444133114110230 |
6 | 132001025112403 |
7 | 11544026531010 |
oct | 1614234302763 |
9 | 378604423213 |
10 | 121910691315 |
11 | 4777a452856 |
12 | 1b763788703 |
13 | b65acc234a |
14 | 5c86dd4707 |
15 | 3287ac64b0 |
hex | 1c627185f3 |
121910691315 has 32 divisors (see below), whose sum is σ = 222937758720. Its totient is φ = 55726763904.
The previous prime is 121910691307. The next prime is 121910691317. The reversal of 121910691315 is 513196019121.
It is not a de Polignac number, because 121910691315 - 23 = 121910691307 is a prime.
It is not an unprimeable number, because it can be changed into a prime (121910691317) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1971802 + ... + 2032688.
It is an arithmetic number, because the mean of its divisors is an integer number (6966804960).
Almost surely, 2121910691315 is an apocalyptic number.
121910691315 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
121910691315 is a deficient number, since it is larger than the sum of its proper divisors (101027067405).
121910691315 is a wasteful number, since it uses less digits than its factorization.
121910691315 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79971.
The product of its (nonzero) digits is 14580, while the sum is 39.
The spelling of 121910691315 in words is "one hundred twenty-one billion, nine hundred ten million, six hundred ninety-one thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •