Base | Representation |
---|---|
bin | 1010100111111011011010… |
… | …10101101000111100010101 |
3 | 10001201101211012111210221002 |
4 | 11103331231111220330111 |
5 | 11030231201321342323 |
6 | 121404232343433045 |
7 | 4630601066236046 |
oct | 523755525507425 |
9 | 101641735453832 |
10 | 23362161512213 |
11 | 749792313a1a7 |
12 | 27538b0755785 |
13 | 1006072146914 |
14 | 5aaa3dc488cd |
15 | 2a7a84154828 |
hex | 153f6d568f15 |
23362161512213 has 4 divisors (see below), whose sum is σ = 23362192680288. Its totient is φ = 23362130344140.
The previous prime is 23362161512201. The next prime is 23362161512219. The reversal of 23362161512213 is 31221516126332.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-23362161512213 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23362161512219) 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, 14431283 + ... + 15968288.
It is an arithmetic number, because the mean of its divisors is an integer number (5840548170072).
Almost surely, 223362161512213 is an apocalyptic number.
It is an amenable number.
23362161512213 is a deficient number, since it is larger than the sum of its proper divisors (31168075).
23362161512213 is an equidigital number, since it uses as much as digits as its factorization.
23362161512213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31168074.
The product of its digits is 77760, while the sum is 38.
Adding to 23362161512213 its reverse (31221516126332), we get a palindrome (54583677638545).
The spelling of 23362161512213 in words is "twenty-three trillion, three hundred sixty-two billion, one hundred sixty-one million, five hundred twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •