Base | Representation |
---|---|
bin | 1010100110001101100111… |
… | …00111110010100001100111 |
3 | 10001111202122211222021020222 |
4 | 11103012303213302201213 |
5 | 11023244434022224111 |
6 | 121321203012314555 |
7 | 4623413203260254 |
oct | 523066347624147 |
9 | 101452584867228 |
10 | 23303211133031 |
11 | 7474922197865 |
12 | 274439a312a5b |
13 | 1000638cab54b |
14 | 5a7c4a93c42b |
15 | 2a6283b357db |
hex | 1531b39f2867 |
23303211133031 has 4 divisors (see below), whose sum is σ = 23308822312512. Its totient is φ = 23297599953552.
The previous prime is 23303211132989. The next prime is 23303211133123. The reversal of 23303211133031 is 13033111230332.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 23303211133031 - 26 = 23303211132967 is a prime.
It is a super-2 number, since 2×233032111330312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23303211133931) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2805583511 + ... + 2805591816.
It is an arithmetic number, because the mean of its divisors is an integer number (5827205578128).
Almost surely, 223303211133031 is an apocalyptic number.
23303211133031 is a deficient number, since it is larger than the sum of its proper divisors (5611179481).
23303211133031 is an equidigital number, since it uses as much as digits as its factorization.
23303211133031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5611179480.
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 23303211133031 its reverse (13033111230332), we get a palindrome (36336322363363).
The spelling of 23303211133031 in words is "twenty-three trillion, three hundred three billion, two hundred eleven million, one hundred thirty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •