Base | Representation |
---|---|
bin | 110010010011100011… |
… | …1001010011001010111 |
3 | 101022211211012110220020 |
4 | 1210213013022121113 |
5 | 3232221233341130 |
6 | 121343425440223 |
7 | 10543044002031 |
oct | 1444707123127 |
9 | 338754173806 |
10 | 108030371415 |
11 | 418a7367a9a |
12 | 18b2b1a0073 |
13 | a2584278c5 |
14 | 532b792c51 |
15 | 2c24233e10 |
hex | 19271ca657 |
108030371415 has 8 divisors (see below), whose sum is σ = 172848594288. Its totient is φ = 57616198080.
The previous prime is 108030371413. The next prime is 108030371429. The reversal of 108030371415 is 514173030801.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 108030371415 - 21 = 108030371413 is a prime.
It is a super-2 number, since 2×1080303714152 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (108030371411) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3601012366 + ... + 3601012395.
It is an arithmetic number, because the mean of its divisors is an integer number (21606074286).
Almost surely, 2108030371415 is an apocalyptic number.
108030371415 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
108030371415 is a deficient number, since it is larger than the sum of its proper divisors (64818222873).
108030371415 is an equidigital number, since it uses as much as digits as its factorization.
108030371415 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7202024769.
The product of its (nonzero) digits is 10080, while the sum is 33.
The spelling of 108030371415 in words is "one hundred eight billion, thirty million, three hundred seventy-one thousand, four hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •