Base | Representation |
---|---|
bin | 1010001100010100000110… |
… | …10010100001111000111111 |
3 | 2221100200202100020201202012 |
4 | 11012022003102201320333 |
5 | 10414210011024220411 |
6 | 115400314105121435 |
7 | 4502211336530615 |
oct | 506120322417077 |
9 | 87320670221665 |
10 | 22413342023231 |
11 | 71614992917a5 |
12 | 261ba32a8927b |
13 | c6775237a633 |
14 | 576b50c2b6b5 |
15 | 28d050c1e18b |
hex | 1462834a1e3f |
22413342023231 has 4 divisors (see below), whose sum is σ = 22413392322264. Its totient is φ = 22413291724200.
The previous prime is 22413342023203. The next prime is 22413342023243. The reversal of 22413342023231 is 13232024331422.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 22413342023231 - 226 = 22413274914367 is a prime.
It is a super-2 number, since 2×224133420232312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22413042023231) 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, 24475085 + ... + 25374326.
It is an arithmetic number, because the mean of its divisors is an integer number (5603348080566).
Almost surely, 222413342023231 is an apocalyptic number.
22413342023231 is a deficient number, since it is larger than the sum of its proper divisors (50299033).
22413342023231 is an equidigital number, since it uses as much as digits as its factorization.
22413342023231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50299032.
The product of its (nonzero) digits is 41472, while the sum is 32.
Adding to 22413342023231 its reverse (13232024331422), we get a palindrome (35645366354653).
The spelling of 22413342023231 in words is "twenty-two trillion, four hundred thirteen billion, three hundred forty-two million, twenty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •