Base | Representation |
---|---|
bin | 1001001011111001011011… |
… | …1010110100001101100001 |
3 | 1022202112212101002100202222 |
4 | 2102332112322310031201 |
5 | 2310434300012113010 |
6 | 33251513114320425 |
7 | 2061462263314601 |
oct | 222762672641541 |
9 | 38675771070688 |
10 | 10100000113505 |
11 | 3244427837425 |
12 | 1171545729115 |
13 | 58356c9a7813 |
14 | 26cbb21bcc01 |
15 | 127ace1a1355 |
hex | 92f96eb4361 |
10100000113505 has 4 divisors (see below), whose sum is σ = 12120000136212. Its totient is φ = 8080000090800.
The previous prime is 10100000113439. The next prime is 10100000113543. The reversal of 10100000113505 is 50531100000101.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2188600689664 + 7911399423841 = 1479392^2 + 2812721^2 .
It is not a de Polignac number, because 10100000113505 - 222 = 10099995919201 is a prime.
It is a Duffinian number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 1010000011346 + ... + 1010000011355.
It is an arithmetic number, because the mean of its divisors is an integer number (3030000034053).
Almost surely, 210100000113505 is an apocalyptic number.
It is an amenable number.
10100000113505 is a deficient number, since it is larger than the sum of its proper divisors (2020000022707).
10100000113505 is an equidigital number, since it uses as much as digits as its factorization.
10100000113505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2020000022706.
The product of its (nonzero) digits is 75, while the sum is 17.
Adding to 10100000113505 its reverse (50531100000101), we get a palindrome (60631100113606).
The spelling of 10100000113505 in words is "ten trillion, one hundred billion, one hundred thirteen thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •