Base | Representation |
---|---|
bin | 1010110000011001101111… |
… | …11110100111100101100111 |
3 | 10002202020100211012210201110 |
4 | 11120030313332213211213 |
5 | 11100014001424423111 |
6 | 122150104223400103 |
7 | 4660616264123550 |
oct | 530146776474547 |
9 | 102666324183643 |
10 | 23653324061031 |
11 | 759a355878635 |
12 | 27a020a453033 |
13 | 1027664098b72 |
14 | 5bab813a9327 |
15 | 2b0425a445a6 |
hex | 158337fa7967 |
23653324061031 has 64 divisors (see below), whose sum is σ = 37176925363200. Its totient is φ = 13097654608896.
The previous prime is 23653324061021. The next prime is 23653324061083. The reversal of 23653324061031 is 13016042335632.
It is not a de Polignac number, because 23653324061031 - 25 = 23653324060999 is a prime.
It is a super-2 number, since 2×236533240610312 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23653324061021) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 89713065 + ... + 89976333.
It is an arithmetic number, because the mean of its divisors is an integer number (580889458800).
Almost surely, 223653324061031 is an apocalyptic number.
23653324061031 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
23653324061031 is a deficient number, since it is larger than the sum of its proper divisors (13523601302169).
23653324061031 is a wasteful number, since it uses less digits than its factorization.
23653324061031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 264328.
The product of its (nonzero) digits is 233280, while the sum is 39.
Adding to 23653324061031 its reverse (13016042335632), we get a palindrome (36669366396663).
The spelling of 23653324061031 in words is "twenty-three trillion, six hundred fifty-three billion, three hundred twenty-four million, sixty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •