Base | Representation |
---|---|
bin | 100111110000100… |
… | …0101001100111111 |
3 | 10102222021212220210 |
4 | 1033201011030333 |
5 | 10213010302002 |
6 | 340213443503 |
7 | 45026266053 |
oct | 11741051477 |
9 | 3388255823 |
10 | 1334072127 |
11 | 62505a153 |
12 | 312940593 |
13 | 1835075bb |
14 | c926dc63 |
15 | 7c1c096c |
hex | 4f84533f |
1334072127 has 16 divisors (see below), whose sum is σ = 1889008992. Its totient is φ = 834570240.
The previous prime is 1334072107. The next prime is 1334072141. The reversal of 1334072127 is 7212704331.
It is not a de Polignac number, because 1334072127 - 211 = 1334070079 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1334072094 and 1334072103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1334072107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 21624 + ... + 55997.
It is an arithmetic number, because the mean of its divisors is an integer number (118063062).
Almost surely, 21334072127 is an apocalyptic number.
1334072127 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
1334072127 is a deficient number, since it is larger than the sum of its proper divisors (554936865).
1334072127 is a wasteful number, since it uses less digits than its factorization.
1334072127 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77978.
The product of its (nonzero) digits is 7056, while the sum is 30.
The square root of 1334072127 is about 36524.9521149583. The cubic root of 1334072127 is about 1100.8456656746.
Adding to 1334072127 its reverse (7212704331), we get a palindrome (8546776458).
The spelling of 1334072127 in words is "one billion, three hundred thirty-four million, seventy-two thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •