Base | Representation |
---|---|
bin | 10011011110000110… |
… | …11110001000100111 |
3 | 222222111101021122101 |
4 | 21233003132020213 |
5 | 132401444143211 |
6 | 4445130312531 |
7 | 520016005123 |
oct | 115703361047 |
9 | 28874337571 |
10 | 10453115431 |
11 | 4484569380 |
12 | 2038888747 |
13 | ca7838205 |
14 | 7123d2583 |
15 | 412a645c1 |
hex | 26f0de227 |
10453115431 has 8 divisors (see below), whose sum is σ = 12074187024. Its totient is φ = 8943841920.
The previous prime is 10453115389. The next prime is 10453115437. The reversal of 10453115431 is 13451135401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10453115431 - 211 = 10453113383 is a prime.
It is a super-2 number, since 2×104531154312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10453115431.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10453115437) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27949320 + ... + 27949693.
It is an arithmetic number, because the mean of its divisors is an integer number (1509273378).
Almost surely, 210453115431 is an apocalyptic number.
10453115431 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10453115431 is a deficient number, since it is larger than the sum of its proper divisors (1621071593).
10453115431 is a wasteful number, since it uses less digits than its factorization.
10453115431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55899041.
The product of its (nonzero) digits is 3600, while the sum is 28.
The spelling of 10453115431 in words is "ten billion, four hundred fifty-three million, one hundred fifteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •