Base | Representation |
---|---|
bin | 1001011110110010011010… |
… | …0001111000010111001011 |
3 | 1100220120112120011112121012 |
4 | 2113230212201320113023 |
5 | 2331243420200340321 |
6 | 34100544112034135 |
7 | 2124101423231216 |
oct | 227544641702713 |
9 | 40816476145535 |
10 | 10424532043211 |
11 | 335a0236315a0 |
12 | 120441683294b |
13 | 5a804c086c60 |
14 | 28079b46477d |
15 | 1312753c505b |
hex | 97b268785cb |
10424532043211 has 16 divisors (see below), whose sum is σ = 12247456542720. Its totient is φ = 8747534869920.
The previous prime is 10424532043183. The next prime is 10424532043241. The reversal of 10424532043211 is 11234023542401.
It is not a de Polignac number, because 10424532043211 - 222 = 10424527848907 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10424532043241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2560886 + ... + 5235188.
It is an arithmetic number, because the mean of its divisors is an integer number (765466033920).
Almost surely, 210424532043211 is an apocalyptic number.
10424532043211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10424532043211 is a deficient number, since it is larger than the sum of its proper divisors (1822924499509).
10424532043211 is a wasteful number, since it uses less digits than its factorization.
10424532043211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2701586.
The product of its (nonzero) digits is 23040, while the sum is 32.
Adding to 10424532043211 its reverse (11234023542401), we get a palindrome (21658555585612).
The spelling of 10424532043211 in words is "ten trillion, four hundred twenty-four billion, five hundred thirty-two million, forty-three thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •