Base | Representation |
---|---|
bin | 100110001001011001111… |
… | …100101011100001010011 |
3 | 100021121101121012112111102 |
4 | 212021121330223201103 |
5 | 320422201404122213 |
6 | 5324134510135015 |
7 | 360251463644243 |
oct | 46113174534123 |
9 | 10247347175442 |
10 | 2621439129683 |
11 | 920823058880 |
12 | 3640767b146b |
13 | 16027ba9861a |
14 | 90c421d5b23 |
15 | 482ca0da158 |
hex | 26259f2b853 |
2621439129683 has 4 divisors (see below), whose sum is σ = 2859751777848. Its totient is φ = 2383126481520.
The previous prime is 2621439129679. The next prime is 2621439129719. The reversal of 2621439129683 is 3869219341262.
2621439129683 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2621439129683 - 22 = 2621439129679 is a prime.
It is a super-2 number, since 2×26214391296832 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2621439129623) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 119156324066 + ... + 119156324087.
It is an arithmetic number, because the mean of its divisors is an integer number (714937944462).
Almost surely, 22621439129683 is an apocalyptic number.
2621439129683 is a deficient number, since it is larger than the sum of its proper divisors (238312648165).
2621439129683 is a wasteful number, since it uses less digits than its factorization.
2621439129683 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 238312648164.
The product of its digits is 6718464, while the sum is 56.
The spelling of 2621439129683 in words is "two trillion, six hundred twenty-one billion, four hundred thirty-nine million, one hundred twenty-nine thousand, six hundred eighty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •