Base | Representation |
---|---|
bin | 1010011110010110111001… |
… | …10111111110000111001001 |
3 | 10000112222000200202110012010 |
4 | 11033023130313332013021 |
5 | 11004334214444113001 |
6 | 120553210011210133 |
7 | 4565050102121463 |
oct | 517133467760711 |
9 | 100488020673163 |
10 | 23033320301001 |
11 | 738041591805a |
12 | 2700018446949 |
13 | cb105704847a |
14 | 598b66541133 |
15 | 29e2399668d6 |
hex | 14f2dcdfe1c9 |
23033320301001 has 8 divisors (see below), whose sum is σ = 31231620747360. Its totient is φ = 15095283360992.
The previous prime is 23033320300999. The next prime is 23033320301003. The reversal of 23033320301001 is 10010302333032.
It is an interprime number because it is at equal distance from previous prime (23033320300999) and next prime (23033320301003).
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 23033320301001 - 21 = 23033320300999 is a prime.
It is not an unprimeable number, because it can be changed into a prime (23033320301003) 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, 65065876380 + ... + 65065876733.
It is an arithmetic number, because the mean of its divisors is an integer number (3903952593420).
Almost surely, 223033320301001 is an apocalyptic number.
It is an amenable number.
23033320301001 is a deficient number, since it is larger than the sum of its proper divisors (8198300446359).
23033320301001 is a wasteful number, since it uses less digits than its factorization.
23033320301001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130131753175.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 23033320301001 its reverse (10010302333032), we get a palindrome (33043622634033).
The spelling of 23033320301001 in words is "twenty-three trillion, thirty-three billion, three hundred twenty million, three hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •