Base | Representation |
---|---|
bin | 1001101111110101… |
… | …11010000000110001 |
3 | 111111201002212122222 |
4 | 10313322322000301 |
5 | 41204141444040 |
6 | 2223140410425 |
7 | 243453044000 |
oct | 46772720061 |
9 | 14451085588 |
10 | 5233156145 |
11 | 2245a86738 |
12 | 10206a6a15 |
13 | 6552545c9 |
14 | 379034c37 |
15 | 20965ebb5 |
hex | 137eba031 |
5233156145 has 32 divisors (see below), whose sum is σ = 7443571200. Its totient is φ = 3529552320.
The previous prime is 5233156129. The next prime is 5233156147. The reversal of 5233156145 is 5416513325.
It is not a de Polignac number, because 5233156145 - 24 = 5233156129 is a prime.
It is a super-2 number, since 2×52331561452 = 54771846475902522050, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (5233156147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 79604 + ... + 129626.
It is an arithmetic number, because the mean of its divisors is an integer number (232611600).
Almost surely, 25233156145 is an apocalyptic number.
It is an amenable number.
5233156145 is a deficient number, since it is larger than the sum of its proper divisors (2210415055).
5233156145 is an equidigital number, since it uses as much as digits as its factorization.
5233156145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50110 (or 50096 counting only the distinct ones).
The product of its digits is 54000, while the sum is 35.
The square root of 5233156145 is about 72340.5567092209. The cubic root of 5233156145 is about 1736.1526108032.
The spelling of 5233156145 in words is "five billion, two hundred thirty-three million, one hundred fifty-six thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •