Base | Representation |
---|---|
bin | 10000001101101000010… |
… | …011110011001001001111 |
3 | 10221111210210021222121001 |
4 | 100031220103303021033 |
5 | 121223233004102401 |
6 | 2211455403121131 |
7 | 143331406264402 |
oct | 20155023631117 |
9 | 3844723258531 |
10 | 1114146550351 |
11 | 39a56375571a |
12 | 15bb195131a7 |
13 | 810a9878b23 |
14 | 3bcd420bd39 |
15 | 1deac8d1601 |
hex | 103684f324f |
1114146550351 has 8 divisors (see below), whose sum is σ = 1121392512944. Its totient is φ = 1106902480320.
The previous prime is 1114146550333. The next prime is 1114146550379. The reversal of 1114146550351 is 1530556414111.
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 1114146550351 - 29 = 1114146549839 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1114146550351.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1114146550301) 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 7 ways as a sum of consecutive naturals, for example, 717796 + ... + 1656358.
It is an arithmetic number, because the mean of its divisors is an integer number (140174064118).
Almost surely, 21114146550351 is an apocalyptic number.
1114146550351 is a deficient number, since it is larger than the sum of its proper divisors (7245962593).
1114146550351 is an equidigital number, since it uses as much as digits as its factorization.
1114146550351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 946281.
The product of its (nonzero) digits is 36000, while the sum is 37.
The spelling of 1114146550351 in words is "one trillion, one hundred fourteen billion, one hundred forty-six million, five hundred fifty thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •