Base | Representation |
---|---|
bin | 1010011111001001111010… |
… | …00101110111111100111101 |
3 | 10000122120201010200220021201 |
4 | 11033210331011313330331 |
5 | 11010311310304043201 |
6 | 121013535154455501 |
7 | 4600036515604054 |
oct | 517447505677475 |
9 | 100576633626251 |
10 | 23060704362301 |
11 | 7390a9846a681 |
12 | 270539b294591 |
13 | cb37cc479938 |
14 | 59a20339939b |
15 | 29ecddab2801 |
hex | 14f93d177f3d |
23060704362301 has 4 divisors (see below), whose sum is σ = 23063340784032. Its totient is φ = 23058067940572.
The previous prime is 23060704362271. The next prime is 23060704362343. The reversal of 23060704362301 is 10326340706032.
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 not a de Polignac number, because 23060704362301 - 27 = 23060704362173 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 (23060704360301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1318197745 + ... + 1318215238.
It is an arithmetic number, because the mean of its divisors is an integer number (5765835196008).
Almost surely, 223060704362301 is an apocalyptic number.
It is an amenable number.
23060704362301 is a deficient number, since it is larger than the sum of its proper divisors (2636421731).
23060704362301 is an equidigital number, since it uses as much as digits as its factorization.
23060704362301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2636421730.
The product of its (nonzero) digits is 108864, while the sum is 37.
The spelling of 23060704362301 in words is "twenty-three trillion, sixty billion, seven hundred four million, three hundred sixty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •