Base | Representation |
---|---|
bin | 1001010100010111001011… |
… | …0000000111000010001111 |
3 | 1100021110020002102112220120 |
4 | 2111011302300013002033 |
5 | 2320330111041342221 |
6 | 33442403150520023 |
7 | 2105131053635103 |
oct | 225056260070217 |
9 | 40243202375816 |
10 | 10245422215311 |
11 | 32a0071819938 |
12 | 119576b206013 |
13 | 5941a69a797a |
14 | 275c49987903 |
15 | 12b790e065c6 |
hex | 95172c0708f |
10245422215311 has 4 divisors (see below), whose sum is σ = 13660562953752. Its totient is φ = 6830281476872.
The previous prime is 10245422215277. The next prime is 10245422215319. The reversal of 10245422215311 is 11351222454201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10245422215311 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10245422215319) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1707570369216 + ... + 1707570369221.
It is an arithmetic number, because the mean of its divisors is an integer number (3415140738438).
Almost surely, 210245422215311 is an apocalyptic number.
10245422215311 is a deficient number, since it is larger than the sum of its proper divisors (3415140738441).
10245422215311 is an equidigital number, since it uses as much as digits as its factorization.
10245422215311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3415140738440.
The product of its (nonzero) digits is 19200, while the sum is 33.
Adding to 10245422215311 its reverse (11351222454201), we get a palindrome (21596644669512).
The spelling of 10245422215311 in words is "ten trillion, two hundred forty-five billion, four hundred twenty-two million, two hundred fifteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •