Base | Representation |
---|---|
bin | 111100100000111010111001… |
… | …010010100110001101100111 |
3 | 1021220100012220021201111110000 |
4 | 330200322321102212031213 |
5 | 234341010031320432012 |
6 | 2342013203221232343 |
7 | 110026226332553310 |
oct | 7440727122461547 |
9 | 1256305807644400 |
10 | 266145052124007 |
11 | 7789053459a541 |
12 | 25a2483b5626b3 |
13 | b5674a863ab24 |
14 | 49a16bc727607 |
15 | 20b809c0ebddc |
hex | f20eb94a6367 |
266145052124007 has 80 divisors (see below), whose sum is σ = 470242522252800. Its totient is φ = 146775089482560.
The previous prime is 266145052123999. The next prime is 266145052124027. The reversal of 266145052124007 is 700421250541662.
266145052124007 is a `hidden beast` number, since 2 + 6 + 6 + 14 + 505 + 2 + 124 + 0 + 0 + 7 = 666.
It is not a de Polignac number, because 266145052124007 - 23 = 266145052123999 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (266145052124027) by changing a digit.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 34497844 + ... + 41501702.
It is an arithmetic number, because the mean of its divisors is an integer number (5878031528160).
Almost surely, 2266145052124007 is an apocalyptic number.
266145052124007 is a gapful number since it is divisible by the number (27) formed by its first and last digit.
266145052124007 is a deficient number, since it is larger than the sum of its proper divisors (204097470128793).
266145052124007 is a wasteful number, since it uses less digits than its factorization.
266145052124007 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7006218 (or 7006209 counting only the distinct ones).
The product of its (nonzero) digits is 806400, while the sum is 45.
The spelling of 266145052124007 in words is "two hundred sixty-six trillion, one hundred forty-five billion, fifty-two million, one hundred twenty-four thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •