Base | Representation |
---|---|
bin | 111101000000000… |
… | …101111001010010 |
3 | 2122022202211221220 |
4 | 331000011321102 |
5 | 4043444344242 |
6 | 245315425510 |
7 | 34235022351 |
oct | 7500057122 |
9 | 2568684856 |
10 | 1023434322 |
11 | 48577a399 |
12 | 2468b5296 |
13 | 134053851 |
14 | 99ccb998 |
15 | 5ecaebec |
hex | 3d005e52 |
1023434322 has 16 divisors (see below), whose sum is σ = 2071530720. Its totient is φ = 337034432.
The previous prime is 1023434317. The next prime is 1023434329. The reversal of 1023434322 is 2234343201.
It is a super-2 number, since 2×10234343222 = 2094835622895199368, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1023434292 and 1023434301.
It is not an unprimeable number, because it can be changed into a prime (1023434329) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1027047 + ... + 1028042.
It is an arithmetic number, because the mean of its divisors is an integer number (129470670).
Almost surely, 21023434322 is an apocalyptic number.
1023434322 is an abundant number, since it is smaller than the sum of its proper divisors (1048096398).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1023434322 is a wasteful number, since it uses less digits than its factorization.
1023434322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2055177.
The product of its (nonzero) digits is 3456, while the sum is 24.
The square root of 1023434322 is about 31991.1600602416. The cubic root of 1023434322 is about 1007.7512042653.
Adding to 1023434322 its reverse (2234343201), we get a palindrome (3257777523).
The spelling of 1023434322 in words is "one billion, twenty-three million, four hundred thirty-four thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •