Base | Representation |
---|---|
bin | 11000010101110110101111… |
… | …101001001011101001011111 |
3 | 112001001100200111000102022200 |
4 | 120111312233221023221133 |
5 | 103012442123201124330 |
6 | 1015404220251542543 |
7 | 31356316602255234 |
oct | 3025665751135137 |
9 | 461040614012280 |
10 | 107055006661215 |
11 | 31124856384208 |
12 | 1000bb8915aa53 |
13 | 4797322862b02 |
14 | 1c616c069178b |
15 | c59b2e183a60 |
hex | 615dafa4ba5f |
107055006661215 has 24 divisors (see below), whose sum is σ = 191960701601760. Its totient is φ = 55127175843264.
The previous prime is 107055006661201. The next prime is 107055006661241. The reversal of 107055006661215 is 512166600550701.
It is a happy number.
It is not a de Polignac number, because 107055006661215 - 222 = 107055002466911 is a prime.
It is a super-2 number, since 2×1070550066612152 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 41017242627 + ... + 41017245236.
It is an arithmetic number, because the mean of its divisors is an integer number (7998362566740).
Almost surely, 2107055006661215 is an apocalyptic number.
107055006661215 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
107055006661215 is a deficient number, since it is larger than the sum of its proper divisors (84905694940545).
107055006661215 is a wasteful number, since it uses less digits than its factorization.
107055006661215 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 82034487903 (or 82034487900 counting only the distinct ones).
The product of its (nonzero) digits is 378000, while the sum is 45.
The spelling of 107055006661215 in words is "one hundred seven trillion, fifty-five billion, six million, six hundred sixty-one thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •