Base | Representation |
---|---|
bin | 1010110001101010010011… |
… | …01000111101000110110011 |
3 | 10002220100222201011101220220 |
4 | 11120311021220331012303 |
5 | 11101221033412413401 |
6 | 122222015355104123 |
7 | 4664010044664204 |
oct | 530651150750663 |
9 | 102810881141826 |
10 | 23696570044851 |
11 | 7606728027330 |
12 | 27a8679442043 |
13 | 102b76679a2c2 |
14 | 5bccc4ad15ab |
15 | 2b16074ae336 |
hex | 158d49a3d1b3 |
23696570044851 has 32 divisors (see below), whose sum is σ = 35051613386496. Its totient is φ = 14118529392000.
The previous prime is 23696570044817. The next prime is 23696570044877. The reversal of 23696570044851 is 15844007569632.
It is a happy number.
It is not a de Polignac number, because 23696570044851 - 29 = 23696570044339 is a prime.
It is a super-2 number, since 2×236965700448512 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (23696570044811) 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 31 ways as a sum of consecutive naturals, for example, 583440 + ... + 6908946.
It is an arithmetic number, because the mean of its divisors is an integer number (1095362918328).
It is a 1-persistent number, because it is pandigital, but 2⋅23696570044851 = 47393140089702 is not.
Almost surely, 223696570044851 is an apocalyptic number.
23696570044851 is a deficient number, since it is larger than the sum of its proper divisors (11355043341645).
23696570044851 is a wasteful number, since it uses less digits than its factorization.
23696570044851 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6327443.
The product of its (nonzero) digits is 43545600, while the sum is 60.
The spelling of 23696570044851 in words is "twenty-three trillion, six hundred ninety-six billion, five hundred seventy million, forty-four thousand, eight hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •