Base | Representation |
---|---|
bin | 111011110110011100110000… |
… | …100011101110100010110111 |
3 | 1021112000012112122121021001122 |
4 | 323312130300203232202313 |
5 | 234000200310141421012 |
6 | 2331500323504014155 |
7 | 106305325305334352 |
oct | 7366346043564267 |
9 | 1245005478537048 |
10 | 263226475342007 |
11 | 769657a3037671 |
12 | 2563307a00135b |
13 | b3b51c4a60578 |
14 | 490032d603299 |
15 | 20671d0ca5e72 |
hex | ef67308ee8b7 |
263226475342007 has 4 divisors (see below), whose sum is σ = 263544766123176. Its totient is φ = 262908184560840.
The previous prime is 263226475341937. The next prime is 263226475342037. The reversal of 263226475342007 is 700243574622362.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 263226475342007 - 28 = 263226475341751 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 263226475342007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (263226475342037) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 159145389344 + ... + 159145390997.
It is an arithmetic number, because the mean of its divisors is an integer number (65886191530794).
Almost surely, 2263226475342007 is an apocalyptic number.
263226475342007 is a deficient number, since it is larger than the sum of its proper divisors (318290781169).
263226475342007 is an equidigital number, since it uses as much as digits as its factorization.
263226475342007 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 318290781168.
The product of its (nonzero) digits is 20321280, while the sum is 53.
The spelling of 263226475342007 in words is "two hundred sixty-three trillion, two hundred twenty-six billion, four hundred seventy-five million, three hundred forty-two thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •