Base | Representation |
---|---|
bin | 1010100100100000000101… |
… | …10011011011111111110001 |
3 | 10001022010212220100110201120 |
4 | 11102100002303123333301 |
5 | 11021314022432410101 |
6 | 121234200133052453 |
7 | 4616232102255060 |
oct | 522200263337761 |
9 | 101263786313646 |
10 | 23244410044401 |
11 | 7451998542647 |
12 | 2734b09a87129 |
13 | cc7c27a54190 |
14 | 5a506d3b41d7 |
15 | 2a49917a5b36 |
hex | 152402cdbff1 |
23244410044401 has 32 divisors (see below), whose sum is σ = 38154931261440. Its totient is φ = 12257490383424.
The previous prime is 23244410044357. The next prime is 23244410044409. The reversal of 23244410044401 is 10444001444232.
It is not a de Polignac number, because 23244410044401 - 225 = 23244376489969 is a prime.
It is not an unprimeable number, because it can be changed into a prime (23244410044409) 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 31 ways as a sum of consecutive naturals, for example, 10431925 + ... + 12462498.
It is an arithmetic number, because the mean of its divisors is an integer number (1192341601920).
Almost surely, 223244410044401 is an apocalyptic number.
23244410044401 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
23244410044401 is a deficient number, since it is larger than the sum of its proper divisors (14910521217039).
23244410044401 is a wasteful number, since it uses less digits than its factorization.
23244410044401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22898165.
The product of its (nonzero) digits is 49152, while the sum is 33.
Adding to 23244410044401 its reverse (10444001444232), we get a palindrome (33688411488633).
The spelling of 23244410044401 in words is "twenty-three trillion, two hundred forty-four billion, four hundred ten million, forty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •