Base | Representation |
---|---|
bin | 10101100011100001… |
… | …000000010111001110 |
3 | 2012201222100000120000 |
4 | 111203201000113032 |
5 | 334344433324402 |
6 | 14344333305130 |
7 | 1446353302230 |
oct | 254341002716 |
9 | 65658300500 |
10 | 23144433102 |
11 | 98a747a16a |
12 | 459b0351a6 |
13 | 224ac8c23b |
14 | 1197b68250 |
15 | 906d3ec1c |
hex | 5638405ce |
23144433102 has 160 divisors (see below), whose sum is σ = 63000537600. Its totient is φ = 6203241792.
The previous prime is 23144433017. The next prime is 23144433119. The reversal of 23144433102 is 20133444132.
It is a super-2 number, since 2×231444331022 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 2214024 + ... + 2224452.
It is an arithmetic number, because the mean of its divisors is an integer number (393753360).
Almost surely, 223144433102 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 23144433102, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (31500268800).
23144433102 is an abundant number, since it is smaller than the sum of its proper divisors (39856104498).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23144433102 is a wasteful number, since it uses less digits than its factorization.
23144433102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10572 (or 10563 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
Adding to 23144433102 its reverse (20133444132), we get a palindrome (43277877234).
The spelling of 23144433102 in words is "twenty-three billion, one hundred forty-four million, four hundred thirty-three thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •