Base | Representation |
---|---|
bin | 1010011101110011101010… |
… | …11010000000110011110101 |
3 | 10000111011012102101111001221 |
4 | 11032321311122000303311 |
5 | 11004032000024302201 |
6 | 120540401012350341 |
7 | 4563510253514410 |
oct | 516716532006365 |
9 | 100434172344057 |
10 | 23014404525301 |
11 | 7373399408882 |
12 | 26b84196153b1 |
13 | cac331189a97 |
14 | 597c9024cb77 |
15 | 29d9cdeb74a1 |
hex | 14ee75680cf5 |
23014404525301 has 4 divisors (see below), whose sum is σ = 26302176600352. Its totient is φ = 19726632450252.
The previous prime is 23014404525293. The next prime is 23014404525323. The reversal of 23014404525301 is 10352540441032.
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 not a de Polignac number, because 23014404525301 - 23 = 23014404525293 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 (23014407525301) 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, 1643886037515 + ... + 1643886037528.
It is an arithmetic number, because the mean of its divisors is an integer number (6575544150088).
Almost surely, 223014404525301 is an apocalyptic number.
It is an amenable number.
23014404525301 is a deficient number, since it is larger than the sum of its proper divisors (3287772075051).
23014404525301 is an equidigital number, since it uses as much as digits as its factorization.
23014404525301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3287772075050.
The product of its (nonzero) digits is 57600, while the sum is 34.
Adding to 23014404525301 its reverse (10352540441032), we get a palindrome (33366944966333).
The spelling of 23014404525301 in words is "twenty-three trillion, fourteen billion, four hundred four million, five hundred twenty-five thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •