Base | Representation |
---|---|
bin | 1000011000111011… |
… | …10101001111010100 |
3 | 102121220021201000221 |
4 | 10030131311033110 |
5 | 33211023123012 |
6 | 2022534444124 |
7 | 216421224040 |
oct | 41435651724 |
9 | 12556251027 |
10 | 4504114132 |
11 | 1a01500681 |
12 | a58503644 |
13 | 56a1b72bb |
14 | 30a29b020 |
15 | 1b5652507 |
hex | 10c7753d4 |
4504114132 has 48 divisors (see below), whose sum is σ = 9119214720. Its totient is φ = 1906664832.
The previous prime is 4504114123. The next prime is 4504114177. The reversal of 4504114132 is 2314114054.
It is a super-2 number, since 2×45041141322 = 40574088228164226848, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 4504114097 and 4504114106.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 1056918 + ... + 1061170.
It is an arithmetic number, because the mean of its divisors is an integer number (189983640).
Almost surely, 24504114132 is an apocalyptic number.
It is an amenable number.
4504114132 is an abundant number, since it is smaller than the sum of its proper divisors (4615100588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4504114132 is a wasteful number, since it uses less digits than its factorization.
4504114132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4720 (or 4718 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 25.
The square root of 4504114132 is about 67112.6972487323. The cubic root of 4504114132 is about 1651.4666032160.
Adding to 4504114132 its reverse (2314114054), we get a palindrome (6818228186).
The spelling of 4504114132 in words is "four billion, five hundred four million, one hundred fourteen thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •