Base | Representation |
---|---|
bin | 1000100111011000… |
… | …00111111010011001 |
3 | 102221100022122100211 |
4 | 10103230013322121 |
5 | 33433034114040 |
6 | 2042544131121 |
7 | 222422260663 |
oct | 42354077231 |
9 | 12840278324 |
10 | 4625301145 |
11 | 1a63953233 |
12 | a91006aa1 |
13 | 5893385aa |
14 | 31c405533 |
15 | 1c10de8ea |
hex | 113b07e99 |
4625301145 has 4 divisors (see below), whose sum is σ = 5550361380. Its totient is φ = 3700240912.
The previous prime is 4625301139. The next prime is 4625301167. The reversal of 4625301145 is 5411035264.
It is a happy number.
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 2399726169 + 2225574976 = 48987^2 + 47176^2 .
It is a cyclic number.
It is not a de Polignac number, because 4625301145 - 23 = 4625301137 is a prime.
It is a super-2 number, since 2×46253011452 = 42786821363876622050, which contains 22 as substring.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 462530110 + ... + 462530119.
It is an arithmetic number, because the mean of its divisors is an integer number (1387590345).
Almost surely, 24625301145 is an apocalyptic number.
It is an amenable number.
4625301145 is a deficient number, since it is larger than the sum of its proper divisors (925060235).
4625301145 is an equidigital number, since it uses as much as digits as its factorization.
4625301145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 925060234.
The product of its (nonzero) digits is 14400, while the sum is 31.
The square root of 4625301145 is about 68009.5665697114. The cubic root of 4625301145 is about 1666.1470865498.
The spelling of 4625301145 in words is "four billion, six hundred twenty-five million, three hundred one thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •