Base | Representation |
---|---|
bin | 10110000110110101… |
… | …010000010000111000 |
3 | 2021021021020200020221 |
4 | 112012311100100320 |
5 | 342103124144142 |
6 | 14523221025424 |
7 | 1500136456261 |
oct | 260665202070 |
9 | 67237220227 |
10 | 23736943672 |
11 | a080982122 |
12 | 4725555274 |
13 | 2313964c00 |
14 | 1212721968 |
15 | 93dd7d767 |
hex | 586d50438 |
23736943672 has 48 divisors (see below), whose sum is σ = 48446570880. Its totient is φ = 10898035200.
The previous prime is 23736943663. The next prime is 23736943673. The reversal of 23736943672 is 27634963732.
It is a happy number.
23736943672 is nontrivially palindromic in base 12.
It is a Harshad number since it is a multiple of its sum of digits (52).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23736943673) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 212272 + ... + 304192.
It is an arithmetic number, because the mean of its divisors is an integer number (1009303560).
Almost surely, 223736943672 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 23736943672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24223285440).
23736943672 is an abundant number, since it is smaller than the sum of its proper divisors (24709627208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
23736943672 is a wasteful number, since it uses less digits than its factorization.
23736943672 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 92144 (or 92127 counting only the distinct ones).
The product of its digits is 6858432, while the sum is 52.
The spelling of 23736943672 in words is "twenty-three billion, seven hundred thirty-six million, nine hundred forty-three thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •