Base | Representation |
---|---|
bin | 1001111111000100101… |
… | …11110100010111110111 |
3 | 1012210121020202200110002 |
4 | 10333202113310113313 |
5 | 21110132134423111 |
6 | 421341302221515 |
7 | 33534226344662 |
oct | 4774227642767 |
9 | 1183536680402 |
10 | 343100311031 |
11 | 1225651a9965 |
12 | 565b372489b |
13 | 2647b2b792a |
14 | 1286b3886d9 |
15 | 8dd145163b |
hex | 4fe25f45f7 |
343100311031 has 4 divisors (see below), whose sum is σ = 348915570600. Its totient is φ = 337285051464.
The previous prime is 343100310967. The next prime is 343100311069. The reversal of 343100311031 is 130113001343.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 343100311031 - 26 = 343100310967 is a prime.
It is a super-2 number, since 2×3431003110312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 343100310994 and 343100311012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (343100311331) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2907629696 + ... + 2907629813.
It is an arithmetic number, because the mean of its divisors is an integer number (87228892650).
Almost surely, 2343100311031 is an apocalyptic number.
343100311031 is a deficient number, since it is larger than the sum of its proper divisors (5815259569).
343100311031 is an equidigital number, since it uses as much as digits as its factorization.
343100311031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5815259568.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 343100311031 its reverse (130113001343), we get a palindrome (473213312374).
The spelling of 343100311031 in words is "three hundred forty-three billion, one hundred million, three hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •