Base | Representation |
---|---|
bin | 101110100111101010… |
… | …0111000111100110111 |
3 | 100120102012021020201102 |
4 | 1131033110320330313 |
5 | 3120013432432043 |
6 | 113554154320315 |
7 | 10142642341025 |
oct | 1351724707467 |
9 | 316365236642 |
10 | 100115124023 |
11 | 39505417522 |
12 | 174a042909b |
13 | 959661a175 |
14 | 4bba46b715 |
15 | 290e3ca6b8 |
hex | 174f538f37 |
100115124023 has 4 divisors (see below), whose sum is σ = 100639287168. Its totient is φ = 99590960880.
The previous prime is 100115123981. The next prime is 100115124041. The reversal of 100115124023 is 320421511001.
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 100115124023 - 218 = 100114861879 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 100115123986 and 100115124004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100115624023) by changing a digit.
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, 262081286 + ... + 262081667.
It is an arithmetic number, because the mean of its divisors is an integer number (25159821792).
Almost surely, 2100115124023 is an apocalyptic number.
100115124023 is a deficient number, since it is larger than the sum of its proper divisors (524163145).
100115124023 is an equidigital number, since it uses as much as digits as its factorization.
100115124023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 524163144.
The product of its (nonzero) digits is 240, while the sum is 20.
Adding to 100115124023 its reverse (320421511001), we get a palindrome (420536635024).
The spelling of 100115124023 in words is "one hundred billion, one hundred fifteen million, one hundred twenty-four thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •