Base | Representation |
---|---|
bin | 1001100000010010001100… |
… | …0101011001111000000011 |
3 | 1101000000220110211211201001 |
4 | 2120010203011121320003 |
5 | 2332204044434103220 |
6 | 34120435325352431 |
7 | 2126001534543340 |
oct | 230044305317003 |
9 | 41000813754631 |
10 | 10450244050435 |
11 | 3369a18369142 |
12 | 12093b1708717 |
13 | 5aa5b8c74c07 |
14 | 281b1a1cd7c7 |
15 | 131c7c83c80a |
hex | 98123159e03 |
10450244050435 has 16 divisors (see below), whose sum is σ = 14331852481536. Its totient is φ = 7165837028448.
The previous prime is 10450244050381. The next prime is 10450244050447. The reversal of 10450244050435 is 53405044205401.
It is not a de Polignac number, because 10450244050435 - 217 = 10450243919363 is a prime.
It is a super-2 number, since 2×104502440504352 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10450244050394 and 10450244050403.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 5376322 + ... + 7057288.
It is an arithmetic number, because the mean of its divisors is an integer number (895740780096).
Almost surely, 210450244050435 is an apocalyptic number.
10450244050435 is a deficient number, since it is larger than the sum of its proper divisors (3881608431101).
10450244050435 is a wasteful number, since it uses less digits than its factorization.
10450244050435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1858602.
The product of its (nonzero) digits is 192000, while the sum is 37.
Adding to 10450244050435 its reverse (53405044205401), we get a palindrome (63855288255836).
The spelling of 10450244050435 in words is "ten trillion, four hundred fifty billion, two hundred forty-four million, fifty thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •