Base | Representation |
---|---|
bin | 110100011001011100… |
… | …010100111100001011 |
3 | 12101012221210211021121 |
4 | 310121130110330023 |
5 | 1410210411243201 |
6 | 41502433420111 |
7 | 4031132162530 |
oct | 643134247413 |
9 | 171187724247 |
10 | 56261431051 |
11 | 21951124961 |
12 | aaa1a0a637 |
13 | 53c8051207 |
14 | 2a1a152d87 |
15 | 16e441d9a1 |
hex | d19714f0b |
56261431051 has 4 divisors (see below), whose sum is σ = 64298778352. Its totient is φ = 48224083752.
The previous prime is 56261431021. The next prime is 56261431081. The reversal of 56261431051 is 15013416265.
56261431051 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (56261431021) and next prime (56261431081).
It is a cyclic number.
It is not a de Polignac number, because 56261431051 - 215 = 56261398283 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 56261430998 and 56261431016.
It is not an unprimeable number, because it can be changed into a prime (56261431021) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4018673640 + ... + 4018673653.
It is an arithmetic number, because the mean of its divisors is an integer number (16074694588).
Almost surely, 256261431051 is an apocalyptic number.
56261431051 is a deficient number, since it is larger than the sum of its proper divisors (8037347301).
56261431051 is an equidigital number, since it uses as much as digits as its factorization.
56261431051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8037347300.
The product of its (nonzero) digits is 21600, while the sum is 34.
The spelling of 56261431051 in words is "fifty-six billion, two hundred sixty-one million, four hundred thirty-one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •