Base | Representation |
---|---|
bin | 10101110011100010… |
… | …010100011111010101 |
3 | 2020102201002110110021 |
4 | 111303202110133111 |
5 | 340422240310031 |
6 | 14431134225141 |
7 | 1456126012423 |
oct | 256342243725 |
9 | 66381073407 |
10 | 23413213141 |
11 | 9a2516a62a |
12 | 46550551b1 |
13 | 2291878996 |
14 | 11c1732113 |
15 | 920733511 |
hex | 5738947d5 |
23413213141 has 8 divisors (see below), whose sum is σ = 23492960568. Its totient is φ = 23333592000.
The previous prime is 23413213129. The next prime is 23413213151. The reversal of 23413213141 is 14131231432.
It can be written as a sum of positive squares in 4 ways, for example, as 427621041 + 22985592100 = 20679^2 + 151610^2 .
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 23413213141 - 27 = 23413213013 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23413213121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 347551 + ... + 409411.
It is an arithmetic number, because the mean of its divisors is an integer number (2936620071).
Almost surely, 223413213141 is an apocalyptic number.
It is an amenable number.
23413213141 is a deficient number, since it is larger than the sum of its proper divisors (79747427).
23413213141 is an equidigital number, since it uses as much as digits as its factorization.
23413213141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63143.
The product of its digits is 1728, while the sum is 25.
Adding to 23413213141 its reverse (14131231432), we get a palindrome (37544444573).
The spelling of 23413213141 in words is "twenty-three billion, four hundred thirteen million, two hundred thirteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •