Base | Representation |
---|---|
bin | 1010101001111101111010… |
… | …01101111000000100100011 |
3 | 10001222002122210001012110111 |
4 | 11110332331031320010203 |
5 | 11032403142102143133 |
6 | 121500340324312151 |
7 | 4635631166204404 |
oct | 524767515700443 |
9 | 101862583035414 |
10 | 23432221131043 |
11 | 7514604a5182a |
12 | 27653a3542657 |
13 | 100c858a3688a |
14 | 5b01a873d9ab |
15 | 2a97d4ae01cd |
hex | 154fbd378123 |
23432221131043 has 8 divisors (see below), whose sum is σ = 23898284741808. Its totient is φ = 22967044417824.
The previous prime is 23432221131029. The next prime is 23432221131071. The reversal of 23432221131043 is 34013112223432.
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 23432221131043 - 29 = 23432221130531 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 23432221130996 and 23432221131014.
It is not an unprimeable number, because it can be changed into a prime (23432221131073) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 221671021 + ... + 221776702.
It is an arithmetic number, because the mean of its divisors is an integer number (2987285592726).
Almost surely, 223432221131043 is an apocalyptic number.
23432221131043 is a deficient number, since it is larger than the sum of its proper divisors (466063610765).
23432221131043 is an equidigital number, since it uses as much as digits as its factorization.
23432221131043 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 443448773.
The product of its (nonzero) digits is 20736, while the sum is 31.
Adding to 23432221131043 its reverse (34013112223432), we get a palindrome (57445333354475).
The spelling of 23432221131043 in words is "twenty-three trillion, four hundred thirty-two billion, two hundred twenty-one million, one hundred thirty-one thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •