Base | Representation |
---|---|
bin | 10000001110010110011… |
… | …101011000000110010111 |
3 | 10221120210202012121012122 |
4 | 100032112131120012113 |
5 | 121231324212003301 |
6 | 2212104302210155 |
7 | 143356530354641 |
oct | 20162635300627 |
9 | 3846722177178 |
10 | 1114920812951 |
11 | 39a920807670 |
12 | 1600b488395b |
13 | 811a10b9c8a |
14 | 3bd68d97891 |
15 | 1e00587281b |
hex | 10396758197 |
1114920812951 has 8 divisors (see below), whose sum is σ = 1216303915008. Its totient is φ = 1013542155000.
The previous prime is 1114920812933. The next prime is 1114920812981. The reversal of 1114920812951 is 1592180294111.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1114920812951 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 (1114920812981) 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, 575225 + ... + 1600226.
It is an arithmetic number, because the mean of its divisors is an integer number (152037989376).
Almost surely, 21114920812951 is an apocalyptic number.
1114920812951 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1114920812951 is a deficient number, since it is larger than the sum of its proper divisors (101383102057).
1114920812951 is a wasteful number, since it uses less digits than its factorization.
1114920812951 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2222053.
The product of its (nonzero) digits is 51840, while the sum is 44.
The spelling of 1114920812951 in words is "one trillion, one hundred fourteen billion, nine hundred twenty million, eight hundred twelve thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •