Base | Representation |
---|---|
bin | 1001011000000000111… |
… | …00111100010110100011 |
3 | 1010210110210200100002211 |
4 | 10230000130330112203 |
5 | 20234210303300220 |
6 | 403552354422551 |
7 | 32162453651614 |
oct | 4540034742643 |
9 | 1123423610084 |
10 | 322130134435 |
11 | 1146840768aa |
12 | 52520891a57 |
13 | 244b8915605 |
14 | 1183c2b9c0b |
15 | 85a5445b5a |
hex | 4b0073c5a3 |
322130134435 has 8 divisors (see below), whose sum is σ = 386559887616. Its totient is φ = 257701623360.
The previous prime is 322130134423. The next prime is 322130134441. The reversal of 322130134435 is 534431031223.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 322130134435 - 213 = 322130126243 is a prime.
It is a super-2 number, since 2×3221301344352 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 322130134397 and 322130134406.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 413502 + ... + 902908.
It is an arithmetic number, because the mean of its divisors is an integer number (48319985952).
Almost surely, 2322130134435 is an apocalyptic number.
322130134435 is a deficient number, since it is larger than the sum of its proper divisors (64429753181).
322130134435 is a wasteful number, since it uses less digits than its factorization.
322130134435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 621053.
The product of its (nonzero) digits is 25920, while the sum is 31.
Adding to 322130134435 its reverse (534431031223), we get a palindrome (856561165658).
The spelling of 322130134435 in words is "three hundred twenty-two billion, one hundred thirty million, one hundred thirty-four thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •