Base | Representation |
---|---|
bin | 1010011101101111011000… |
… | …10011111000101011010110 |
3 | 10000110221021010101001221020 |
4 | 11032313230103320223112 |
5 | 11004012242214044114 |
6 | 120535340445502010 |
7 | 4563366254231046 |
oct | 516675423705326 |
9 | 100427233331836 |
10 | 23012104440534 |
11 | 737241903a080 |
12 | 26b7a97271906 |
13 | cac0557b5191 |
14 | 597b1299b726 |
15 | 29d8e70caaa9 |
hex | 14edec4f8ad6 |
23012104440534 has 32 divisors (see below), whose sum is σ = 50316669033984. Its totient is φ = 6958303709280.
The previous prime is 23012104440509. The next prime is 23012104440541. The reversal of 23012104440534 is 43504440121032.
It is a super-2 number, since 2×230121044405342 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 23012104440495 and 23012104440504.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 376501029 + ... + 376562144.
It is an arithmetic number, because the mean of its divisors is an integer number (1572395907312).
Almost surely, 223012104440534 is an apocalyptic number.
23012104440534 is an abundant number, since it is smaller than the sum of its proper divisors (27304564593450).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23012104440534 is a wasteful number, since it uses less digits than its factorization.
23012104440534 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 753063652.
The product of its (nonzero) digits is 46080, while the sum is 33.
Adding to 23012104440534 its reverse (43504440121032), we get a palindrome (66516544561566).
The spelling of 23012104440534 in words is "twenty-three trillion, twelve billion, one hundred four million, four hundred forty thousand, five hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •