Base | Representation |
---|---|
bin | 1010011101011110110110… |
… | …11011100010101101011001 |
3 | 10000110002100201222211222222 |
4 | 11032233123123202231121 |
5 | 11003341104203103231 |
6 | 120531312155353425 |
7 | 4562633341622000 |
oct | 516573333425531 |
9 | 100402321884888 |
10 | 23003231300441 |
11 | 7369685415647 |
12 | 26b621b752875 |
13 | cab2703c1322 |
14 | 597510369c37 |
15 | 29d57810c27b |
hex | 14ebdb6e2b59 |
23003231300441 has 16 divisors (see below), whose sum is σ = 27750957648000. Its totient is φ = 19037156930064.
The previous prime is 23003231300437. The next prime is 23003231300477. The reversal of 23003231300441 is 14400313230032.
It is not a de Polignac number, because 23003231300441 - 22 = 23003231300437 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 23003231300441.
It is not an unprimeable number, because it can be changed into a prime (23003231300741) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1156279955 + ... + 1156299848.
It is an arithmetic number, because the mean of its divisors is an integer number (1734434853000).
Almost surely, 223003231300441 is an apocalyptic number.
It is an amenable number.
23003231300441 is a deficient number, since it is larger than the sum of its proper divisors (4747726347559).
23003231300441 is an equidigital number, since it uses as much as digits as its factorization.
23003231300441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2312579853 (or 2312579839 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 23003231300441 its reverse (14400313230032), we get a palindrome (37403544530473).
The spelling of 23003231300441 in words is "twenty-three trillion, three billion, two hundred thirty-one million, three hundred thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •