Base | Representation |
---|---|
bin | 1001001100011010111101… |
… | …0111000000000111110011 |
3 | 1022210102002121010112200102 |
4 | 2103012233113000013303 |
5 | 2311111213010340344 |
6 | 33300002135143015 |
7 | 2062231306000451 |
oct | 223065727000763 |
9 | 38712077115612 |
10 | 10109000090099 |
11 | 3248226012009 |
12 | 1173237814a6b |
13 | 58437544a261 |
14 | 26d3c75c99d1 |
15 | 127e59375e4e |
hex | 931af5c01f3 |
10109000090099 has 4 divisors (see below), whose sum is σ = 10641052726440. Its totient is φ = 9576947453760.
The previous prime is 10109000090071. The next prime is 10109000090117. The reversal of 10109000090099 is 99009000090101.
It is a happy number.
10109000090099 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 10109000090099 - 232 = 10104705122803 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10109000090009) 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, 266026318142 + ... + 266026318179.
It is an arithmetic number, because the mean of its divisors is an integer number (2660263181610).
Almost surely, 210109000090099 is an apocalyptic number.
10109000090099 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
10109000090099 is a deficient number, since it is larger than the sum of its proper divisors (532052636341).
10109000090099 is an equidigital number, since it uses as much as digits as its factorization.
10109000090099 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 532052636340.
The product of its (nonzero) digits is 6561, while the sum is 38.
The spelling of 10109000090099 in words is "ten trillion, one hundred nine billion, ninety thousand, ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •