Base | Representation |
---|---|
bin | 10111011111101001100101… |
… | …111011011111011000101001 |
3 | 111112212020212200110121021122 |
4 | 113133221211323133120221 |
5 | 102020424402011113113 |
6 | 1003433054553145025 |
7 | 30523230360155300 |
oct | 2737514573373051 |
9 | 445766780417248 |
10 | 103330033301033 |
11 | 2aa19025a987a0 |
12 | b70a0770bb175 |
13 | 4586c98a29196 |
14 | 1b732b3883437 |
15 | be2cb81c8408 |
hex | 5dfa65edf629 |
103330033301033 has 48 divisors (see below), whose sum is σ = 131277390850944. Its totient is φ = 80424919491840.
The previous prime is 103330033301021. The next prime is 103330033301063. The reversal of 103330033301033 is 330103330033301.
It is not a de Polignac number, because 103330033301033 - 28 = 103330033300777 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103330033300993 and 103330033301011.
It is not an unprimeable number, because it can be changed into a prime (103330033301003) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 5185418516 + ... + 5185438442.
It is an arithmetic number, because the mean of its divisors is an integer number (2734945642728).
Almost surely, 2103330033301033 is an apocalyptic number.
It is an amenable number.
103330033301033 is a deficient number, since it is larger than the sum of its proper divisors (27947357549911).
103330033301033 is a wasteful number, since it uses less digits than its factorization.
103330033301033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30462 (or 30455 counting only the distinct ones).
The product of its (nonzero) digits is 6561, while the sum is 26.
Adding to 103330033301033 its reverse (330103330033301), we get a palindrome (433433363334334).
The spelling of 103330033301033 in words is "one hundred three trillion, three hundred thirty billion, thirty-three million, three hundred one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •