Base | Representation |
---|---|
bin | 100111110001011001101… |
… | …010011100110010000101 |
3 | 100200021121200102022022011 |
4 | 213301121222130302011 |
5 | 324234343444003141 |
6 | 5451323113134221 |
7 | 401313565304440 |
oct | 47613152346205 |
9 | 10607550368264 |
10 | 2733103500421 |
11 | 964114746298 |
12 | 38183a9ba371 |
13 | 16a966048788 |
14 | 963d6468657 |
15 | 4b163399881 |
hex | 27c59a9cc85 |
2733103500421 has 8 divisors (see below), whose sum is σ = 3123761488704. Its totient is φ = 2342499169920.
The previous prime is 2733103500377. The next prime is 2733103500443. The reversal of 2733103500421 is 1240053013372.
2733103500421 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2733103500421 - 219 = 2733102976133 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 (2733103501421) 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, 13305235 + ... + 13509088.
It is an arithmetic number, because the mean of its divisors is an integer number (390470186088).
Almost surely, 22733103500421 is an apocalyptic number.
It is an amenable number.
2733103500421 is a deficient number, since it is larger than the sum of its proper divisors (390657988283).
2733103500421 is a wasteful number, since it uses less digits than its factorization.
2733103500421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26828891.
The product of its (nonzero) digits is 15120, while the sum is 31.
Adding to 2733103500421 its reverse (1240053013372), we get a palindrome (3973156513793).
The spelling of 2733103500421 in words is "two trillion, seven hundred thirty-three billion, one hundred three million, five hundred thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •