Base | Representation |
---|---|
bin | 1010100110001001100001… |
… | …01010111011110101011101 |
3 | 10001111112222201221120112221 |
4 | 11103010300222323311131 |
5 | 11023230434110023201 |
6 | 121320201011225341 |
7 | 4623304565203420 |
oct | 523046052736535 |
9 | 101445881846487 |
10 | 23301014142301 |
11 | 74739a5033145 |
12 | 2743a865a8251 |
13 | 1000378a9182c |
14 | 5a7abcc459b7 |
15 | 2a61a5d104a1 |
hex | 153130abbd5d |
23301014142301 has 8 divisors (see below), whose sum is σ = 26630453454080. Its totient is φ = 19971755581968.
The previous prime is 23301014142293. The next prime is 23301014142311. The reversal of 23301014142301 is 10324141010332.
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 23301014142301 - 23 = 23301014142293 is a prime.
It is a super-2 number, since 2×233010141423012 (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 (23301014142311) 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, 44911506 + ... + 45427363.
It is an arithmetic number, because the mean of its divisors is an integer number (3328806681760).
Almost surely, 223301014142301 is an apocalyptic number.
It is an amenable number.
23301014142301 is a deficient number, since it is larger than the sum of its proper divisors (3329439311779).
23301014142301 is an equidigital number, since it uses as much as digits as its factorization.
23301014142301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 90375723.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 23301014142301 its reverse (10324141010332), we get a palindrome (33625155152633).
The spelling of 23301014142301 in words is "twenty-three trillion, three hundred one billion, fourteen million, one hundred forty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •