Base | Representation |
---|---|
bin | 10010011101111100000… |
… | …100101100100010000001 |
3 | 11111022202112211021020001 |
4 | 102131330010230202001 |
5 | 131243102310124311 |
6 | 2411003132120001 |
7 | 160455256104301 |
oct | 22357404544201 |
9 | 4438675737201 |
10 | 1269096958081 |
11 | 44a248169427 |
12 | 185b62006001 |
13 | 928a1912214 |
14 | 455d3231601 |
15 | 2302adbd4c1 |
hex | 1277c12c881 |
1269096958081 has 16 divisors (see below), whose sum is σ = 1332659926528. Its totient is φ = 1207032710400.
The previous prime is 1269096958069. The next prime is 1269096958093. The reversal of 1269096958081 is 1808596909621.
It is an interprime number because it is at equal distance from previous prime (1269096958069) and next prime (1269096958093).
It is a cyclic number.
It is not a de Polignac number, because 1269096958081 - 213 = 1269096949889 is a prime.
It is a super-2 number, since 2×12690969580812 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1269096950081) 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, 193771 + ... + 1604911.
It is an arithmetic number, because the mean of its divisors is an integer number (83291245408).
Almost surely, 21269096958081 is an apocalyptic number.
It is an amenable number.
1269096958081 is a deficient number, since it is larger than the sum of its proper divisors (63562968447).
1269096958081 is a wasteful number, since it uses less digits than its factorization.
1269096958081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1411672.
The product of its (nonzero) digits is 16796160, while the sum is 64.
The spelling of 1269096958081 in words is "one trillion, two hundred sixty-nine billion, ninety-six million, nine hundred fifty-eight thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •