Base | Representation |
---|---|
bin | 1010100111010101111101… |
… | …01011101111011101101111 |
3 | 10001122110220200211111012020 |
4 | 11103222332223233131233 |
5 | 11024414010131032421 |
6 | 121351105042441223 |
7 | 4626256536302430 |
oct | 523527653573557 |
9 | 101573820744166 |
10 | 23342051424111 |
11 | 748a343559382 |
12 | 274ba19963213 |
13 | 10041b8a057c4 |
14 | 5a9a930a7487 |
15 | 2a72a88dedc6 |
hex | 153abeaef76f |
23342051424111 has 32 divisors (see below), whose sum is σ = 35586300907008. Its totient is φ = 13331768832000.
The previous prime is 23342051424089. The next prime is 23342051424121. The reversal of 23342051424111 is 11142415024332.
It is not a de Polignac number, because 23342051424111 - 25 = 23342051424079 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23342051424121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 456435535 + ... + 456486671.
It is an arithmetic number, because the mean of its divisors is an integer number (1112071903344).
Almost surely, 223342051424111 is an apocalyptic number.
23342051424111 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
23342051424111 is a deficient number, since it is larger than the sum of its proper divisors (12244249482897).
23342051424111 is a wasteful number, since it uses less digits than its factorization.
23342051424111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61391.
The product of its (nonzero) digits is 23040, while the sum is 33.
Adding to 23342051424111 its reverse (11142415024332), we get a palindrome (34484466448443).
The spelling of 23342051424111 in words is "twenty-three trillion, three hundred forty-two billion, fifty-one million, four hundred twenty-four thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •