Base | Representation |
---|---|
bin | 111101101001101… |
… | …000100011111111 |
3 | 2200002021010002120 |
4 | 331221220203333 |
5 | 4104241333343 |
6 | 250345054023 |
7 | 34426416342 |
oct | 7551504377 |
9 | 2602233076 |
10 | 1034324223 |
11 | 490938109 |
12 | 24a487313 |
13 | 13639748a |
14 | 9b524459 |
15 | 60c11683 |
hex | 3da688ff |
1034324223 has 16 divisors (see below), whose sum is σ = 1452384000. Its totient is φ = 652942080.
The previous prime is 1034324219. The next prime is 1034324227. The reversal of 1034324223 is 3224234301.
It is an interprime number because it is at equal distance from previous prime (1034324219) and next prime (1034324227).
It is not a de Polignac number, because 1034324223 - 22 = 1034324219 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1034324193 and 1034324202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1034324227) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 188878 + ... + 194276.
It is an arithmetic number, because the mean of its divisors is an integer number (90774000).
Almost surely, 21034324223 is an apocalyptic number.
1034324223 is a deficient number, since it is larger than the sum of its proper divisors (418059777).
1034324223 is a wasteful number, since it uses less digits than its factorization.
1034324223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8782.
The product of its (nonzero) digits is 3456, while the sum is 24.
The square root of 1034324223 is about 32160.9114143241. The cubic root of 1034324223 is about 1011.3129423812.
Adding to 1034324223 its reverse (3224234301), we get a palindrome (4258558524).
The spelling of 1034324223 in words is "one billion, thirty-four million, three hundred twenty-four thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •