Base | Representation |
---|---|
bin | 10010101101011000… |
… | …00010100100100010 |
3 | 221221000011022210010 |
4 | 21112230002210202 |
5 | 131032321220114 |
6 | 4340404345350 |
7 | 503623211610 |
oct | 112654024442 |
9 | 27830138703 |
10 | 10044320034 |
11 | 4294836341 |
12 | 1b439a5256 |
13 | c40c37448 |
14 | 6b3dbc6b0 |
15 | 3dbc14c59 |
hex | 256b02922 |
10044320034 has 32 divisors (see below), whose sum is σ = 23492367360. Its totient is φ = 2803065552.
The previous prime is 10044319921. The next prime is 10044320057. The reversal of 10044320034 is 43002344001.
It is a super-2 number, since 2×100443200342 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2779014 + ... + 2782625.
It is an arithmetic number, because the mean of its divisors is an integer number (734136480).
Almost surely, 210044320034 is an apocalyptic number.
10044320034 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
10044320034 is an abundant number, since it is smaller than the sum of its proper divisors (13448047326).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10044320034 is a wasteful number, since it uses less digits than its factorization.
10044320034 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5561694.
The product of its (nonzero) digits is 1152, while the sum is 21.
Adding to 10044320034 its reverse (43002344001), we get a palindrome (53046664035).
It can be divided in two parts, 10044 and 320034, that added together give a triangular number (330078 = T812).
The spelling of 10044320034 in words is "ten billion, forty-four million, three hundred twenty thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •