Base | Representation |
---|---|
bin | 10011011001101000… |
… | …11110101110010001 |
3 | 222212212211220000100 |
4 | 21230310132232101 |
5 | 132312400144444 |
6 | 4441311043013 |
7 | 516052255602 |
oct | 115464365621 |
9 | 28785756010 |
10 | 10415631249 |
11 | 4465396a11 |
12 | 2028210469 |
13 | c9cb4281a |
14 | 70b435da9 |
15 | 40e60ce69 |
hex | 26cd1eb91 |
10415631249 has 9 divisors (see below), whose sum is σ = 15045242953. Its totient is φ = 6943550052.
The previous prime is 10415631241. The next prime is 10415631287. The reversal of 10415631249 is 94213651401.
It is a happy number.
The square root of 10415631249 is 102057.
It is a perfect power (a square), and thus also a powerful number.
10415631249 is a `hidden beast` number, since 1 + 0 + 4 + 15 + 631 + 2 + 4 + 9 = 666.
It is a tau number, because it is divible by the number of its divisors (9).
It is not a de Polignac number, because 10415631249 - 23 = 10415631241 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10415631241) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 289162 + ... + 323180.
Almost surely, 210415631249 is an apocalyptic number.
10415631249 is the 102057-th square number.
10415631249 is the 51029-th centered octagonal number.
It is an amenable number.
10415631249 is a deficient number, since it is larger than the sum of its proper divisors (4629611704).
10415631249 is an frugal number, since it uses more digits than its factorization.
10415631249 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 68044 (or 34022 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 36.
Multiplying 10415631249 by its sum of digits (36), we get a square (374962724964 = 6123422).
The spelling of 10415631249 in words is "ten billion, four hundred fifteen million, six hundred thirty-one thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •