Base | Representation |
---|---|
bin | 10011001111111101… |
… | …01111001110110110 |
3 | 222200020001122122100 |
4 | 21213332233032312 |
5 | 132131103343410 |
6 | 4425250442530 |
7 | 514045145601 |
oct | 114776571666 |
9 | 28606048570 |
10 | 10334434230 |
11 | 442357843a |
12 | 2004b93446 |
13 | c89083653 |
14 | 70073b338 |
15 | 40741e8c0 |
hex | 267faf3b6 |
10334434230 has 48 divisors (see below), whose sum is σ = 26875255680. Its totient is φ = 2755261824.
The previous prime is 10334434219. The next prime is 10334434247. The reversal of 10334434230 is 3243443301.
It is a super-4 number, since 4×103344342304 (a number of 41 digits) contains 4444 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10334434194 and 10334434203.
It is a congruent number.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 560539 + ... + 578681.
It is an arithmetic number, because the mean of its divisors is an integer number (559901160).
Almost surely, 210334434230 is an apocalyptic number.
10334434230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10334434230 is an abundant number, since it is smaller than the sum of its proper divisors (16540821450).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10334434230 is a wasteful number, since it uses less digits than its factorization.
10334434230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24485 (or 24482 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 27.
Adding to 10334434230 its reverse (3243443301), we get a palindrome (13577877531).
The spelling of 10334434230 in words is "ten billion, three hundred thirty-four million, four hundred thirty-four thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •