Base | Representation |
---|---|
bin | 111101011001111… |
… | …100101011110111 |
3 | 2122210112012122201 |
4 | 331121330223313 |
5 | 4102213243333 |
6 | 250121005331 |
7 | 34346442346 |
oct | 7531745367 |
9 | 2583465581 |
10 | 1030212343 |
11 | 489589866 |
12 | 249023847 |
13 | 135587a04 |
14 | 9ab73b5d |
15 | 6069d17d |
hex | 3d67caf7 |
1030212343 has 8 divisors (see below), whose sum is σ = 1090146816. Its totient is φ = 971539800.
The previous prime is 1030212341. The next prime is 1030212383. The reversal of 1030212343 is 3432120301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1030212343 - 21 = 1030212341 is a prime.
It is a super-2 number, since 2×10302123432 = 2122674943339099298, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1030212343.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1030212341) 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, 313803 + ... + 317068.
It is an arithmetic number, because the mean of its divisors is an integer number (136268352).
Almost surely, 21030212343 is an apocalyptic number.
1030212343 is a deficient number, since it is larger than the sum of its proper divisors (59934473).
1030212343 is an equidigital number, since it uses as much as digits as its factorization.
1030212343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 630965.
The product of its (nonzero) digits is 432, while the sum is 19.
The square root of 1030212343 is about 32096.9210828702. The cubic root of 1030212343 is about 1009.9710291334.
Adding to 1030212343 its reverse (3432120301), we get a palindrome (4462332644).
The spelling of 1030212343 in words is "one billion, thirty million, two hundred twelve thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •