Base | Representation |
---|---|
bin | 10101101101100100… |
… | …000101111010101001 |
3 | 2020011201112211200022 |
4 | 111231210011322221 |
5 | 340221112430231 |
6 | 14413154450225 |
7 | 1453501232063 |
oct | 255544057251 |
9 | 66151484608 |
10 | 23313014441 |
11 | 9983652892 |
12 | 4627593975 |
13 | 2276b95902 |
14 | 11b22cc733 |
15 | 916a3ec7b |
hex | 56d905ea9 |
23313014441 has 8 divisors (see below), whose sum is σ = 23756352840. Its totient is φ = 22869804672.
The previous prime is 23313014437. The next prime is 23313014467. The reversal of 23313014441 is 14441031332.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 8760211216 + 14552803225 = 93596^2 + 120635^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 23313014441 - 22 = 23313014437 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 23313014441.
It is not an unprimeable number, because it can be changed into a prime (23313013441) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 384581 + ... + 441053.
It is an arithmetic number, because the mean of its divisors is an integer number (2969544105).
Almost surely, 223313014441 is an apocalyptic number.
It is an amenable number.
23313014441 is a deficient number, since it is larger than the sum of its proper divisors (443338399).
23313014441 is an equidigital number, since it uses as much as digits as its factorization.
23313014441 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 64315.
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 23313014441 its reverse (14441031332), we get a palindrome (37754045773).
The spelling of 23313014441 in words is "twenty-three billion, three hundred thirteen million, fourteen thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •