Base | Representation |
---|---|
bin | 11101110110011010001… |
… | …00011110111110010001 |
3 | 10122001100210201121222201 |
4 | 32323031010132332101 |
5 | 113301004014034134 |
6 | 2103101311003201 |
7 | 134046245200033 |
oct | 16731504367621 |
9 | 3561323647881 |
10 | 1025642721169 |
11 | 365a77639940 |
12 | 146939809501 |
13 | 75943a07c31 |
14 | 378d9cd7c53 |
15 | 1ba2ca94914 |
hex | eecd11ef91 |
1025642721169 has 16 divisors (see below), whose sum is σ = 1178124238080. Its totient is φ = 883064140560.
The previous prime is 1025642721163. The next prime is 1025642721199. The reversal of 1025642721169 is 9611272465201.
It is a cyclic number.
It is not a de Polignac number, because 1025642721169 - 215 = 1025642688401 is a prime.
It is a super-2 number, since 2×10256427211692 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1025642721163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 33579 + ... + 1432624.
It is an arithmetic number, because the mean of its divisors is an integer number (73632764880).
Almost surely, 21025642721169 is an apocalyptic number.
1025642721169 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
It is an amenable number.
1025642721169 is a deficient number, since it is larger than the sum of its proper divisors (152481516911).
1025642721169 is a wasteful number, since it uses less digits than its factorization.
1025642721169 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1469580.
The product of its (nonzero) digits is 362880, while the sum is 46.
The spelling of 1025642721169 in words is "one trillion, twenty-five billion, six hundred forty-two million, seven hundred twenty-one thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •