Base | Representation |
---|---|
bin | 100111001001… |
… | …000000000001 |
3 | 201022021201211 |
4 | 213021000001 |
5 | 10111313411 |
6 | 1003530121 |
7 | 153132640 |
oct | 47110001 |
9 | 21267654 |
10 | 10260481 |
11 | 5878940 |
12 | 3529941 |
13 | 21832ba |
14 | 1511357 |
15 | d7a221 |
hex | 9c9001 |
10260481 has 8 divisors (see below), whose sum is σ = 12792384. Its totient is φ = 7995120.
The previous prime is 10260463. The next prime is 10260491. The reversal of 10260481 is 18406201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10260481 - 25 = 10260449 is a prime.
It is a super-2 number, since 2×102604812 = 210554940702722, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10260491) by changing a digit.
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, 66550 + ... + 66703.
It is an arithmetic number, because the mean of its divisors is an integer number (1599048).
It is a Proth number, since it is equal to 2505 ⋅ 212 + 1 and 2505 < 212.
Almost surely, 210260481 is an apocalyptic number.
10260481 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10260481 is a deficient number, since it is larger than the sum of its proper divisors (2531903).
10260481 is a wasteful number, since it uses less digits than its factorization.
10260481 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133271.
The product of its (nonzero) digits is 384, while the sum is 22.
The square root of 10260481 is about 3203.1985576920. The cubic root of 10260481 is about 217.2980889210.
Adding to 10260481 its reverse (18406201), we get a palindrome (28666682).
The spelling of 10260481 in words is "ten million, two hundred sixty thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •