Base | Representation |
---|---|
bin | 110000111010000000… |
… | …0100111000111111111 |
3 | 101001002102001211200220 |
4 | 1201310000213013333 |
5 | 3210043014014130 |
6 | 120125325352423 |
7 | 10405426203336 |
oct | 1416400470777 |
9 | 331072054626 |
10 | 105025532415 |
11 | 405a51a1a81 |
12 | 18430a08713 |
13 | 9b99a3a96b |
14 | 512468ad1d |
15 | 2aea536410 |
hex | 18740271ff |
105025532415 has 16 divisors (see below), whose sum is σ = 177925608288. Its totient is φ = 52718698496.
The previous prime is 105025532413. The next prime is 105025532429. The reversal of 105025532415 is 514235520501.
It is a cyclic number.
It is not a de Polignac number, because 105025532415 - 21 = 105025532413 is a prime.
It is a super-2 number, since 2×1050255324152 (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 (105025532413) 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 15 ways as a sum of consecutive naturals, for example, 205932162 + ... + 205932671.
It is an arithmetic number, because the mean of its divisors is an integer number (11120350518).
Almost surely, 2105025532415 is an apocalyptic number.
105025532415 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
105025532415 is a deficient number, since it is larger than the sum of its proper divisors (72900075873).
105025532415 is a wasteful number, since it uses less digits than its factorization.
105025532415 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 411864858.
The product of its (nonzero) digits is 30000, while the sum is 33.
The spelling of 105025532415 in words is "one hundred five billion, twenty-five million, five hundred thirty-two thousand, four hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •