Base | Representation |
---|---|
bin | 1001111000100011… |
… | …10001111110111001 |
3 | 111200210200000021020 |
4 | 10330101301332321 |
5 | 41331400331213 |
6 | 2234311333053 |
7 | 245331322644 |
oct | 47421617671 |
9 | 14623600236 |
10 | 5306261433 |
11 | 2283278830 |
12 | 1041081189 |
13 | 66743c685 |
14 | 384a24a5b |
15 | 210ca0923 |
hex | 13c471fb9 |
5306261433 has 16 divisors (see below), whose sum is σ = 7720723200. Its totient is φ = 3214864080.
The previous prime is 5306261431. The next prime is 5306261453. The reversal of 5306261433 is 3341626035.
It is not a de Polignac number, because 5306261433 - 21 = 5306261431 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 5306261394 and 5306261403.
It is not an unprimeable number, because it can be changed into a prime (5306261431) 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, 82878 + ... + 132216.
It is an arithmetic number, because the mean of its divisors is an integer number (482545200).
Almost surely, 25306261433 is an apocalyptic number.
It is an amenable number.
5306261433 is a deficient number, since it is larger than the sum of its proper divisors (2414461767).
5306261433 is a wasteful number, since it uses less digits than its factorization.
5306261433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52612.
The product of its (nonzero) digits is 38880, while the sum is 33.
The square root of 5306261433 is about 72844.0898975339. The cubic root of 5306261433 is about 1744.1997280629.
Adding to 5306261433 its reverse (3341626035), we get a palindrome (8647887468).
The spelling of 5306261433 in words is "five billion, three hundred six million, two hundred sixty-one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •