Base | Representation |
---|---|
bin | 10111000001000110000100… |
… | …001101011101100110001001 |
3 | 111021102112002211012001010120 |
4 | 113001012010031131212021 |
5 | 101232024124343233113 |
6 | 555144320415133453 |
7 | 30215435155261464 |
oct | 2701060415354611 |
9 | 437375084161116 |
10 | 101230302321033 |
11 | 2a289591656596 |
12 | b42b13b514289 |
13 | 4463c90627112 |
14 | 1add8039a02db |
15 | ba8374900a23 |
hex | 5c118435d989 |
101230302321033 has 8 divisors (see below), whose sum is σ = 134973897259488. Its totient is φ = 67486787798304.
The previous prime is 101230302321011. The next prime is 101230302321061. The reversal of 101230302321033 is 330123203032101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101230302321033 - 218 = 101230302058889 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101230302320994 and 101230302321012.
It is not an unprimeable number, because it can be changed into a prime (101230302321833) 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, 17102635 + ... + 22247712.
It is an arithmetic number, because the mean of its divisors is an integer number (16871737157436).
Almost surely, 2101230302321033 is an apocalyptic number.
It is an amenable number.
101230302321033 is a deficient number, since it is larger than the sum of its proper divisors (33743594938455).
101230302321033 is an equidigital number, since it uses as much as digits as its factorization.
101230302321033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40207863.
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 101230302321033 its reverse (330123203032101), we get a palindrome (431353505353134).
The spelling of 101230302321033 in words is "one hundred one trillion, two hundred thirty billion, three hundred two million, three hundred twenty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •