Base | Representation |
---|---|
bin | 1111010001111001… |
… | …1100110011111000 |
3 | 101120211221001001011 |
4 | 3310132130303320 |
5 | 31400003414112 |
6 | 1515000003304 |
7 | 203433135433 |
oct | 36436346370 |
9 | 11524831034 |
10 | 4101623032 |
11 | 1815294101 |
12 | 965760534 |
13 | 5049b2ba0 |
14 | 2aca4881a |
15 | 19014aaa7 |
hex | f479ccf8 |
4101623032 has 32 divisors (see below), whose sum is σ = 8287700400. Its totient is φ = 1891782144.
The previous prime is 4101623017. The next prime is 4101623047. The reversal of 4101623032 is 2303261014.
It is an interprime number because it is at equal distance from previous prime (4101623017) and next prime (4101623047).
It is a super-2 number, since 2×41016230322 = 33646622993265746048, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4101622994 and 4101623012.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 151728 + ... + 176704.
Almost surely, 24101623032 is an apocalyptic number.
It is an amenable number.
4101623032 is an abundant number, since it is smaller than the sum of its proper divisors (4186077368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4101623032 is a wasteful number, since it uses less digits than its factorization.
4101623032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26575 (or 26571 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 22.
The square root of 4101623032 is about 64043.9148709696. The cubic root of 4101623032 is about 1600.7318308387.
Adding to 4101623032 its reverse (2303261014), we get a palindrome (6404884046).
The spelling of 4101623032 in words is "four billion, one hundred one million, six hundred twenty-three thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •