Base | Representation |
---|---|
bin | 1001000001011111… |
… | …0100000010000111 |
3 | 20020210201112222210 |
4 | 2100113310002013 |
5 | 14430033132133 |
6 | 1040203154503 |
7 | 114011014314 |
oct | 22027640207 |
9 | 6223645883 |
10 | 2422161543 |
11 | 10332798aa |
12 | 577215a33 |
13 | 2c7a77ba9 |
14 | 18d98bd0b |
15 | e29a2763 |
hex | 905f4087 |
2422161543 has 8 divisors (see below), whose sum is σ = 3230262000. Its totient is φ = 1614417728.
The previous prime is 2422161541. The next prime is 2422161557. The reversal of 2422161543 is 3451612242.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2422161543 - 21 = 2422161541 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2422161543.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2422161541) 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, 72888 + ... + 100781.
It is an arithmetic number, because the mean of its divisors is an integer number (403782750).
Almost surely, 22422161543 is an apocalyptic number.
2422161543 is a deficient number, since it is larger than the sum of its proper divisors (808100457).
2422161543 is a wasteful number, since it uses less digits than its factorization.
2422161543 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 178321.
The product of its digits is 11520, while the sum is 30.
The square root of 2422161543 is about 49215.4604062585. The cubic root of 2422161543 is about 1342.9742990162.
Adding to 2422161543 its reverse (3451612242), we get a palindrome (5873773785).
The spelling of 2422161543 in words is "two billion, four hundred twenty-two million, one hundred sixty-one thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •