Base | Representation |
---|---|
bin | 1001010100000101011000… |
… | …0001110101010001000011 |
3 | 1100020222220011220212212010 |
4 | 2111001112001311101003 |
5 | 2320240320202321223 |
6 | 33440253150104003 |
7 | 2104601511200301 |
oct | 225012601652103 |
9 | 40228804825763 |
10 | 10240645354563 |
11 | 3299040369738 |
12 | 11948574ab003 |
13 | 5938c5145650 |
14 | 2759153ad271 |
15 | 12b5b187a393 |
hex | 95056075443 |
10240645354563 has 32 divisors (see below), whose sum is σ = 15130296659520. Its totient is φ = 6121812902400.
The previous prime is 10240645354543. The next prime is 10240645354579. The reversal of 10240645354563 is 36545354604201.
It is not a de Polignac number, because 10240645354563 - 210 = 10240645353539 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10240645354543) 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 31 ways as a sum of consecutive naturals, for example, 24317728 + ... + 24735261.
It is an arithmetic number, because the mean of its divisors is an integer number (472821770610).
Almost surely, 210240645354563 is an apocalyptic number.
10240645354563 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
10240645354563 is a deficient number, since it is larger than the sum of its proper divisors (4889651304957).
10240645354563 is a wasteful number, since it uses less digits than its factorization.
10240645354563 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49053159.
The product of its (nonzero) digits is 5184000, while the sum is 48.
Adding to 10240645354563 its reverse (36545354604201), we get a palindrome (46785999958764).
The spelling of 10240645354563 in words is "ten trillion, two hundred forty billion, six hundred forty-five million, three hundred fifty-four thousand, five hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •