Base | Representation |
---|---|
bin | 1010100010010010… |
… | …11100010001100101 |
3 | 112121012111201211112 |
4 | 11101021130101211 |
5 | 43041014200101 |
6 | 2333140114405 |
7 | 260112403031 |
oct | 52111342145 |
9 | 15535451745 |
10 | 5656396901 |
11 | 2442985791 |
12 | 111a395a05 |
13 | 6c1b4241c |
14 | 3b93291c1 |
15 | 2318b46bb |
hex | 15125c465 |
5656396901 has 4 divisors (see below), whose sum is σ = 5851445100. Its totient is φ = 5461348704.
The previous prime is 5656396891. The next prime is 5656396913. The reversal of 5656396901 is 1096936565.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3822330625 + 1834066276 = 61825^2 + 42826^2 .
It is a cyclic number.
It is not a de Polignac number, because 5656396901 - 226 = 5589288037 is a prime.
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 5656396901.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5656396981) 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, 97524056 + ... + 97524113.
It is an arithmetic number, because the mean of its divisors is an integer number (1462861275).
Almost surely, 25656396901 is an apocalyptic number.
It is an amenable number.
5656396901 is a deficient number, since it is larger than the sum of its proper divisors (195048199).
5656396901 is a wasteful number, since it uses less digits than its factorization.
5656396901 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 195048198.
The product of its (nonzero) digits is 1312200, while the sum is 50.
The square root of 5656396901 is about 75209.0214070094. The cubic root of 5656396901 is about 1781.7494164038.
The spelling of 5656396901 in words is "five billion, six hundred fifty-six million, three hundred ninety-six thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •