Base | Representation |
---|---|
bin | 1100100100010… |
… | …00001010000000 |
3 | 21100100122121020 |
4 | 12102020022000 |
5 | 203441242141 |
6 | 14243225440 |
7 | 2420005140 |
oct | 622101200 |
9 | 240318536 |
10 | 105415296 |
11 | 54560088 |
12 | 2b378280 |
13 | 18abb61c |
14 | 10000920 |
15 | 93c4266 |
hex | 6488280 |
105415296 has 64 divisors (see below), whose sum is σ = 320018880. Its totient is φ = 30117888.
The previous prime is 105415267. The next prime is 105415337. The reversal of 105415296 is 692514501.
It is a tau number, because it is divible by the number of its divisors (64).
It is a super-2 number, since 2×1054152962 = 22224769261535232, which contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16921 + ... + 22296.
It is an arithmetic number, because the mean of its divisors is an integer number (5000295).
Almost surely, 2105415296 is an apocalyptic number.
105415296 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
105415296 is an abundant number, since it is smaller than the sum of its proper divisors (214603584).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105415296 is an equidigital number, since it uses as much as digits as its factorization.
105415296 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39241 (or 39229 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 33.
The square root of 105415296 is about 10267.1951379138. The cubic root of 105415296 is about 472.3905605837.
Adding to 105415296 its reverse (692514501), we get a palindrome (797929797).
The spelling of 105415296 in words is "one hundred five million, four hundred fifteen thousand, two hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •