Base | Representation |
---|---|
bin | 1010011110000100001000… |
… | …00110111111010011101011 |
3 | 10000112000000021000120120111 |
4 | 11033002010012333103223 |
5 | 11004203044212144433 |
6 | 120544421515435151 |
7 | 4564242243442063 |
oct | 517020406772353 |
9 | 100460007016514 |
10 | 23023241131243 |
11 | 73771134496a1 |
12 | 26ba084a55ab7 |
13 | cb010bb2b7b2 |
14 | 59848ba903a3 |
15 | 29dd49b6adcd |
hex | 14f0841bf4eb |
23023241131243 has 4 divisors (see below), whose sum is σ = 23064134988168. Its totient is φ = 22982347274320.
The previous prime is 23023241131223. The next prime is 23023241131277. The reversal of 23023241131243 is 34213114232032.
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 23023241131243 - 229 = 23022704260331 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23023241131223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20446927618 + ... + 20446928743.
It is an arithmetic number, because the mean of its divisors is an integer number (5766033747042).
Almost surely, 223023241131243 is an apocalyptic number.
23023241131243 is a deficient number, since it is larger than the sum of its proper divisors (40893856925).
23023241131243 is an equidigital number, since it uses as much as digits as its factorization.
23023241131243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40893856924.
The product of its (nonzero) digits is 20736, while the sum is 31.
Adding to 23023241131243 its reverse (34213114232032), we get a palindrome (57236355363275).
The spelling of 23023241131243 in words is "twenty-three trillion, twenty-three billion, two hundred forty-one million, one hundred thirty-one thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.032 sec. • engine limits •