Base | Representation |
---|---|
bin | 1001111010100111… |
… | …00101100111110001 |
3 | 111202000010110000102 |
4 | 10331103211213301 |
5 | 41400304343210 |
6 | 2240125202145 |
7 | 245631052016 |
oct | 47523454761 |
9 | 14660113012 |
10 | 5323512305 |
11 | 2291a90651 |
12 | 1046a00355 |
13 | 66ab9c6a7 |
14 | 38703570d |
15 | 21255bea5 |
hex | 13d4e59f1 |
5323512305 has 16 divisors (see below), whose sum is σ = 6465439440. Its totient is φ = 4207408128.
The previous prime is 5323512301. The next prime is 5323512329. The reversal of 5323512305 is 5032153235.
It can be written as a sum of positive squares in 8 ways, for example, as 840942001 + 4482570304 = 28999^2 + 66952^2 .
It is a cyclic number.
It is not a de Polignac number, because 5323512305 - 22 = 5323512301 is a prime.
It is a super-2 number, since 2×53235123052 = 56679566522972826050, which contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (5323512301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 606629 + ... + 615341.
It is an arithmetic number, because the mean of its divisors is an integer number (404089965).
Almost surely, 25323512305 is an apocalyptic number.
It is an amenable number.
5323512305 is a deficient number, since it is larger than the sum of its proper divisors (1141927135).
5323512305 is a wasteful number, since it uses less digits than its factorization.
5323512305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10180.
The product of its (nonzero) digits is 13500, while the sum is 29.
The square root of 5323512305 is about 72962.4033663914. The cubic root of 5323512305 is about 1746.0878382121.
The spelling of 5323512305 in words is "five billion, three hundred twenty-three million, five hundred twelve thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •