Base | Representation |
---|---|
bin | 1001001001111100101001… |
… | …11011000100110000011111 |
3 | 2122021200211002200021221210 |
4 | 10210332110323010300133 |
5 | 10114324401104332203 |
6 | 110452551024555503 |
7 | 4145363522230605 |
oct | 444762473046037 |
9 | 78250732607853 |
10 | 20133010230303 |
11 | 64623a8454803 |
12 | 2311ab4482b93 |
13 | b306c4a12419 |
14 | 4d862b433875 |
15 | 24da8c10e803 |
hex | 124f94ec4c1f |
20133010230303 has 16 divisors (see below), whose sum is σ = 27710721119232. Its totient is φ = 12988677192000.
The previous prime is 20133010230301. The next prime is 20133010230331. The reversal of 20133010230303 is 30303201033102.
It is not a de Polignac number, because 20133010230303 - 21 = 20133010230301 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20133010230303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20133010230301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 364363 + ... + 6356003.
It is an arithmetic number, because the mean of its divisors is an integer number (1731920069952).
Almost surely, 220133010230303 is an apocalyptic number.
20133010230303 is a deficient number, since it is larger than the sum of its proper divisors (7577710888929).
20133010230303 is a wasteful number, since it uses less digits than its factorization.
20133010230303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6027806.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 20133010230303 its reverse (30303201033102), we get a palindrome (50436211263405).
The spelling of 20133010230303 in words is "twenty trillion, one hundred thirty-three billion, ten million, two hundred thirty thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.010 sec. • engine limits •