Base | Representation |
---|---|
bin | 1100110001110011… |
… | …1010100111111110 |
3 | 22212001101202211011 |
4 | 3030130322213332 |
5 | 24011103212342 |
6 | 1324211345434 |
7 | 151000433326 |
oct | 31434724776 |
9 | 8761352734 |
10 | 3430132222 |
11 | 1500247120 |
12 | 7b88b227a |
13 | 42884604a |
14 | 2477b2286 |
15 | 15120a717 |
hex | cc73a9fe |
3430132222 has 8 divisors (see below), whose sum is σ = 5612943672. Its totient is φ = 1559151000.
The previous prime is 3430132219. The next prime is 3430132229. The reversal of 3430132222 is 2222310343.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (22), and also a Moran number because the ratio is a prime number: 155915101 = 3430132222 / (3 + 4 + 3 + 0 + 1 + 3 + 2 + 2 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 3430132193 and 3430132202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3430132229) 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, 77957529 + ... + 77957572.
It is an arithmetic number, because the mean of its divisors is an integer number (701617959).
Almost surely, 23430132222 is an apocalyptic number.
3430132222 is a deficient number, since it is larger than the sum of its proper divisors (2182811450).
3430132222 is a wasteful number, since it uses less digits than its factorization.
3430132222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 155915114.
The product of its (nonzero) digits is 1728, while the sum is 22.
The square root of 3430132222 is about 58567.3306716296. The cubic root of 3430132222 is about 1508.1236612538.
Adding to 3430132222 its reverse (2222310343), we get a palindrome (5652442565).
The spelling of 3430132222 in words is "three billion, four hundred thirty million, one hundred thirty-two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •