Base | Representation |
---|---|
bin | 1010100101011100010110… |
… | …01001111011010001111000 |
3 | 10001102020101121001001000012 |
4 | 11102232023021323101320 |
5 | 11022331302134142102 |
6 | 121301110320401052 |
7 | 4621455604663664 |
oct | 522561311732170 |
9 | 101366347031005 |
10 | 23276762412152 |
11 | 746468a615357 |
12 | 273b238776188 |
13 | ccacb2598452 |
14 | 5a685bddd8a4 |
15 | 2a5736b97752 |
hex | 152b8b27b478 |
23276762412152 has 16 divisors (see below), whose sum is σ = 44067656995440. Its totient is φ = 11525387213376.
The previous prime is 23276762412151. The next prime is 23276762412173. The reversal of 23276762412152 is 25121426767232.
It is a super-2 number, since 2×232767624121522 (a number of 28 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 23276762412152.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23276762412151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14124248213 + ... + 14124249860.
It is an arithmetic number, because the mean of its divisors is an integer number (2754228562215).
Almost surely, 223276762412152 is an apocalyptic number.
It is an amenable number.
23276762412152 is a deficient number, since it is larger than the sum of its proper divisors (20790894583288).
23276762412152 is a wasteful number, since it uses less digits than its factorization.
23276762412152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28248498182 (or 28248498178 counting only the distinct ones).
The product of its digits is 3386880, while the sum is 50.
The spelling of 23276762412152 in words is "twenty-three trillion, two hundred seventy-six billion, seven hundred sixty-two million, four hundred twelve thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •