Base | Representation |
---|---|
bin | 10010110110110100… |
… | …11001000001000000 |
3 | 222010112022010021021 |
4 | 21123122121001000 |
5 | 131213114020311 |
6 | 4352315235224 |
7 | 505605001624 |
oct | 113332310100 |
9 | 28115263237 |
10 | 10123579456 |
11 | 43255510a1 |
12 | 1b66448b14 |
13 | c54498703 |
14 | 6c0731184 |
15 | 3e3b6e171 |
hex | 25b699040 |
10123579456 has 21 divisors (see below), whose sum is σ = 20090575389. Its totient is φ = 5061387264.
The previous prime is 10123579451. The next prime is 10123579457. The reversal of 10123579456 is 65497532101.
The square root of 10123579456 is 100616.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 9316110400 + 807469056 = 96520^2 + 28416^2 .
It is a super-2 number, since 2×101235794562 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10123579451) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 798640 + ... + 811216.
Almost surely, 210123579456 is an apocalyptic number.
10123579456 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
10123579456 is the 100616-th square number.
It is an amenable number.
10123579456 is a deficient number, since it is larger than the sum of its proper divisors (9966995933).
10123579456 is an frugal number, since it uses more digits than its factorization.
10123579456 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25166 (or 12579 counting only the distinct ones).
The product of its (nonzero) digits is 226800, while the sum is 43.
The spelling of 10123579456 in words is "ten billion, one hundred twenty-three million, five hundred seventy-nine thousand, four hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •