Base | Representation |
---|---|
bin | 10100011110110… |
… | …100010110110010 |
3 | 212221120212021010 |
4 | 110132310112302 |
5 | 1200431414330 |
6 | 54033011350 |
7 | 11341514406 |
oct | 2436642662 |
9 | 787525233 |
10 | 343623090 |
11 | 166a6a128 |
12 | 970b3b56 |
13 | 56262795 |
14 | 338cb106 |
15 | 202793b0 |
hex | 147b45b2 |
343623090 has 16 divisors (see below), whose sum is σ = 824695488. Its totient is φ = 91632816.
The previous prime is 343623089. The next prime is 343623097. The reversal of 343623090 is 90326343.
It is a super-2 number, since 2×3436230902 = 236153655962296200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30), and also a Moran number because the ratio is a prime number: 11454103 = 343623090 / (3 + 4 + 3 + 6 + 2 + 3 + 0 + 9 + 0).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (343623097) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5727022 + ... + 5727081.
It is an arithmetic number, because the mean of its divisors is an integer number (51543468).
Almost surely, 2343623090 is an apocalyptic number.
343623090 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
343623090 is an abundant number, since it is smaller than the sum of its proper divisors (481072398).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
343623090 is a wasteful number, since it uses less digits than its factorization.
343623090 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11454113.
The product of its (nonzero) digits is 11664, while the sum is 30.
The square root of 343623090 is about 18537.0733936077. The cubic root of 343623090 is about 700.4236143407.
The spelling of 343623090 in words is "three hundred forty-three million, six hundred twenty-three thousand, ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •