Base | Representation |
---|---|
bin | 10101100011010100… |
… | …000111011100110101 |
3 | 2012201201222100122202 |
4 | 111203110013130311 |
5 | 334343102214021 |
6 | 14344133034245 |
7 | 1446312500333 |
oct | 254324073465 |
9 | 65651870582 |
10 | 23141054261 |
11 | 98a5581636 |
12 | 4599a85985 |
13 | 224a378320 |
14 | 1197528b53 |
15 | 9068c3a0b |
hex | 563507735 |
23141054261 has 8 divisors (see below), whose sum is σ = 25088393400. Its totient is φ = 21217609152.
The previous prime is 23141054257. The next prime is 23141054297. The reversal of 23141054261 is 16245014132.
It can be written as a sum of positive squares in 4 ways, for example, as 276590161 + 22864464100 = 16631^2 + 151210^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 23141054261 - 22 = 23141054257 is a prime.
It is a super-2 number, since 2×231410542612 (a number of 22 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 (23141054201) 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, 5971490 + ... + 5975363.
It is an arithmetic number, because the mean of its divisors is an integer number (3136049175).
Almost surely, 223141054261 is an apocalyptic number.
It is an amenable number.
23141054261 is a deficient number, since it is larger than the sum of its proper divisors (1947339139).
23141054261 is a wasteful number, since it uses less digits than its factorization.
23141054261 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11947015.
The product of its (nonzero) digits is 5760, while the sum is 29.
Adding to 23141054261 its reverse (16245014132), we get a palindrome (39386068393).
The spelling of 23141054261 in words is "twenty-three billion, one hundred forty-one million, fifty-four thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •