Base | Representation |
---|---|
bin | 1001111111111001100… |
… | …01000001010011011100 |
3 | 1012211202002222222022022 |
4 | 10333330301001103130 |
5 | 21112034020001322 |
6 | 421453241235312 |
7 | 33551214245300 |
oct | 4777461012334 |
9 | 1184662888268 |
10 | 343543125212 |
11 | 1227721577a1 |
12 | 566b7a92b38 |
13 | 2651bc69961 |
14 | 128b00d5d00 |
15 | 8e0a270942 |
hex | 4ffcc414dc |
343543125212 has 72 divisors (see below), whose sum is σ = 714745592064. Its totient is φ = 143997261408.
The previous prime is 343543125199. The next prime is 343543125217. The reversal of 343543125212 is 212521345343.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (343543125217) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 13648823 + ... + 13673969.
It is an arithmetic number, because the mean of its divisors is an integer number (9927022112).
Almost surely, 2343543125212 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 343543125212, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (357372796032).
343543125212 is an abundant number, since it is smaller than the sum of its proper divisors (371202466852).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
343543125212 is a wasteful number, since it uses less digits than its factorization.
343543125212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26695 (or 26686 counting only the distinct ones).
The product of its digits is 86400, while the sum is 35.
It can be divided in two parts, 3435431 and 25212, that added together give a palindrome (3460643).
The spelling of 343543125212 in words is "three hundred forty-three billion, five hundred forty-three million, one hundred twenty-five thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •