Base | Representation |
---|---|
bin | 1001001101000100011000… |
… | …1101111100101100111001 |
3 | 1022211110210122002212012202 |
4 | 2103101012031330230321 |
5 | 2311302001434323001 |
6 | 33305041443115545 |
7 | 2063104014161411 |
oct | 223210615745471 |
9 | 38743718085182 |
10 | 10120121011001 |
11 | 3251a12530531 |
12 | 1175420072bb5 |
13 | 585428431a21 |
14 | 26db60575641 |
15 | 1283aa84d96b |
hex | 9344637cb39 |
10120121011001 has 8 divisors (see below), whose sum is σ = 10132319735520. Its totient is φ = 10107924581088.
The previous prime is 10120121010977. The next prime is 10120121011061. The reversal of 10120121011001 is 10011012102101.
10120121011001 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 a cyclic number.
It is not a de Polignac number, because 10120121011001 - 214 = 10120120994617 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10120121011061) 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, 8335730 + ... + 9472308.
It is an arithmetic number, because the mean of its divisors is an integer number (1266539966940).
Almost surely, 210120121011001 is an apocalyptic number.
It is an amenable number.
10120121011001 is a deficient number, since it is larger than the sum of its proper divisors (12198724519).
10120121011001 is an equidigital number, since it uses as much as digits as its factorization.
10120121011001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1147303.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 10120121011001 its reverse (10011012102101), we get a palindrome (20131133113102).
The spelling of 10120121011001 in words is "ten trillion, one hundred twenty billion, one hundred twenty-one million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •