Base | Representation |
---|---|
bin | 10100011101100… |
… | …111111100111110 |
3 | 212220222221222110 |
4 | 110131213330332 |
5 | 1200341411032 |
6 | 54022154450 |
7 | 11336042130 |
oct | 2435477476 |
9 | 786887873 |
10 | 343310142 |
11 | 166875a9a |
12 | 96b82a26 |
13 | 561831c6 |
14 | 33849050 |
15 | 202167cc |
hex | 14767f3e |
343310142 has 64 divisors (see below), whose sum is σ = 802897920. Its totient is φ = 95842656.
The previous prime is 343310131. The next prime is 343310239. The reversal of 343310142 is 241013343.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 354543 + ... + 355509.
It is an arithmetic number, because the mean of its divisors is an integer number (12545280).
Almost surely, 2343310142 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 343310142, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (401448960).
343310142 is an abundant number, since it is smaller than the sum of its proper divisors (459587778).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
343310142 is a wasteful number, since it uses less digits than its factorization.
343310142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1165.
The product of its (nonzero) digits is 864, while the sum is 21.
The square root of 343310142 is about 18528.6303325421. The cubic root of 343310142 is about 700.2109173944.
Adding to 343310142 its reverse (241013343), we get a palindrome (584323485).
The spelling of 343310142 in words is "three hundred forty-three million, three hundred ten thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •