Base | Representation |
---|---|
bin | 1100000110000… |
… | …01100110000001 |
3 | 21001220111211011 |
4 | 12003001212001 |
5 | 201433100012 |
6 | 14022320521 |
7 | 2341235560 |
oct | 603014601 |
9 | 231814734 |
10 | 101456257 |
11 | 522a6651 |
12 | 29b89141 |
13 | 180335b6 |
14 | d68dbd7 |
15 | 8d911a7 |
hex | 60c1981 |
101456257 has 32 divisors (see below), whose sum is σ = 128044800. Its totient is φ = 78444288.
The previous prime is 101456249. The next prime is 101456261. The reversal of 101456257 is 752654101.
It is a cyclic number.
It is not a de Polignac number, because 101456257 - 23 = 101456249 is a prime.
It is not an unprimeable number, because it can be changed into a prime (101456227) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 260619 + ... + 261007.
It is an arithmetic number, because the mean of its divisors is an integer number (4001400).
Almost surely, 2101456257 is an apocalyptic number.
It is an amenable number.
101456257 is a deficient number, since it is larger than the sum of its proper divisors (26588543).
101456257 is a wasteful number, since it uses less digits than its factorization.
101456257 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 505.
The product of its (nonzero) digits is 8400, while the sum is 31.
The square root of 101456257 is about 10072.5496772168. The cubic root of 101456257 is about 466.4011493552.
The spelling of 101456257 in words is "one hundred one million, four hundred fifty-six thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •