Base | Representation |
---|---|
bin | 110111000001111001100101… |
… | …000101111111101100001011 |
3 | 1011201221011221012011002020110 |
4 | 313001321211011333230023 |
5 | 223210301303404400021 |
6 | 2214423513444325403 |
7 | 101656410055006560 |
oct | 6701714505775413 |
9 | 1151834835132213 |
10 | 242023103200011 |
11 | 70130470255331 |
12 | 231898476a3863 |
13 | a5078b0671053 |
14 | 43a9da3062867 |
15 | 1cea89a181476 |
hex | dc1e6517fb0b |
242023103200011 has 16 divisors (see below), whose sum is σ = 368913486233600. Its totient is φ = 138255274891008.
The previous prime is 242023103200009. The next prime is 242023103200019. The reversal of 242023103200011 is 110002301320242.
It is not a de Polignac number, because 242023103200011 - 21 = 242023103200009 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (242023103200019) 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, 1818316171 + ... + 1818449268.
It is an arithmetic number, because the mean of its divisors is an integer number (23057092889600).
Almost surely, 2242023103200011 is an apocalyptic number.
242023103200011 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
242023103200011 is a deficient number, since it is larger than the sum of its proper divisors (126890383033589).
242023103200011 is a wasteful number, since it uses less digits than its factorization.
242023103200011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3636768618.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 242023103200011 its reverse (110002301320242), we get a palindrome (352025404520253).
The spelling of 242023103200011 in words is "two hundred forty-two trillion, twenty-three billion, one hundred three million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •