Base | Representation |
---|---|
bin | 101010100111111… |
… | …0111010110011001 |
3 | 10200200012211001211 |
4 | 1111033313112121 |
5 | 10412114102413 |
6 | 353530343121 |
7 | 50304455056 |
oct | 12517672631 |
9 | 3620184054 |
10 | 1430222233 |
11 | 674361150 |
12 | 33ab8aaa1 |
13 | 19a40095b |
14 | d7d3c02d |
15 | 8586483d |
hex | 553f7599 |
1430222233 has 4 divisors (see below), whose sum is σ = 1560242448. Its totient is φ = 1300202020.
The previous prime is 1430222191. The next prime is 1430222249. The reversal of 1430222233 is 3322220341.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1430222233 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1430222273) 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 3 ways as a sum of consecutive naturals, for example, 65010091 + ... + 65010112.
It is an arithmetic number, because the mean of its divisors is an integer number (390060612).
Almost surely, 21430222233 is an apocalyptic number.
It is an amenable number.
1430222233 is a deficient number, since it is larger than the sum of its proper divisors (130020215).
1430222233 is a wasteful number, since it uses less digits than its factorization.
1430222233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130020214.
The product of its (nonzero) digits is 1728, while the sum is 22.
The square root of 1430222233 is about 37818.2790856485. The cubic root of 1430222233 is about 1126.6815302806.
Adding to 1430222233 its reverse (3322220341), we get a palindrome (4752442574).
The spelling of 1430222233 in words is "one billion, four hundred thirty million, two hundred twenty-two thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •