Base | Representation |
---|---|
bin | 1010101010001101001110… |
… | …01011011000110000011011 |
3 | 10001222212212122202210001101 |
4 | 11111012213023120300123 |
5 | 11033022010434024311 |
6 | 121504220131332231 |
7 | 4636341662463346 |
oct | 525064713306033 |
9 | 101885778683041 |
10 | 23440441314331 |
11 | 7518043038138 |
12 | 2766ab8451077 |
13 | 1010568a7c962 |
14 | 5b074836145d |
15 | 2a9b165ceec1 |
hex | 1551a72d8c1b |
23440441314331 has 4 divisors (see below), whose sum is σ = 23467729372600. Its totient is φ = 23413153256064.
The previous prime is 23440441314313. The next prime is 23440441314371. The reversal of 23440441314331 is 13341314404432.
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 23440441314331 - 211 = 23440441312283 is a prime.
It is a super-2 number, since 2×234404413143312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23440441314371) 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, 13644027846 + ... + 13644029563.
It is an arithmetic number, because the mean of its divisors is an integer number (5866932343150).
Almost surely, 223440441314331 is an apocalyptic number.
23440441314331 is a deficient number, since it is larger than the sum of its proper divisors (27288058269).
23440441314331 is an equidigital number, since it uses as much as digits as its factorization.
23440441314331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 27288058268.
The product of its (nonzero) digits is 165888, while the sum is 37.
Adding to 23440441314331 its reverse (13341314404432), we get a palindrome (36781755718763).
The spelling of 23440441314331 in words is "twenty-three trillion, four hundred forty billion, four hundred forty-one million, three hundred fourteen thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •