Base | Representation |
---|---|
bin | 10010110101010000… |
… | …10001111110101010 |
3 | 222002121120202000221 |
4 | 21122220101332222 |
5 | 131201233142214 |
6 | 4351125520254 |
7 | 505355231320 |
oct | 113250217652 |
9 | 28077522027 |
10 | 10110443434 |
11 | 4319099883 |
12 | 1b61b7308a |
13 | c51849610 |
14 | 6bcab1d10 |
15 | 3e2926e24 |
hex | 25aa11faa |
10110443434 has 16 divisors (see below), whose sum is σ = 18665434368. Its totient is φ = 3999735792.
The previous prime is 10110443389. The next prime is 10110443443. The reversal of 10110443434 is 43434401101.
10110443434 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×101104434342 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10110443399 and 10110443408.
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 7 ways as a sum of consecutive naturals, for example, 27775762 + ... + 27776125.
It is an arithmetic number, because the mean of its divisors is an integer number (1166589648).
Almost surely, 210110443434 is an apocalyptic number.
10110443434 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
10110443434 is a deficient number, since it is larger than the sum of its proper divisors (8554990934).
10110443434 is a wasteful number, since it uses less digits than its factorization.
10110443434 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55551909.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 10110443434 its reverse (43434401101), we get a palindrome (53544844535).
The spelling of 10110443434 in words is "ten billion, one hundred ten million, four hundred forty-three thousand, four hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •