Base | Representation |
---|---|
bin | 1011011011010111… |
… | …01111011011111100 |
3 | 120211120100221002002 |
4 | 11231223233123330 |
5 | 100031044302312 |
6 | 2452441321432 |
7 | 305014626443 |
oct | 55553573374 |
9 | 16746327062 |
10 | 6135150332 |
11 | 2669150283 |
12 | 1232796278 |
13 | 76a09888c |
14 | 422b4dd5a |
15 | 25d9324c2 |
hex | 16daef6fc |
6135150332 has 24 divisors (see below), whose sum is σ = 11760078960. Its totient is φ = 2787572480.
The previous prime is 6135150319. The next prime is 6135150337. The reversal of 6135150332 is 2330515316.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a junction number, because it is equal to n+sod(n) for n = 6135150295 and 6135150304.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6135150337) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1553594 + ... + 1557537.
It is an arithmetic number, because the mean of its divisors is an integer number (490003290).
Almost surely, 26135150332 is an apocalyptic number.
It is an amenable number.
6135150332 is a deficient number, since it is larger than the sum of its proper divisors (5624928628).
6135150332 is a wasteful number, since it uses less digits than its factorization.
6135150332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3111181 (or 3111179 counting only the distinct ones).
The product of its (nonzero) digits is 8100, while the sum is 29.
The square root of 6135150332 is about 78327.2004606318. The cubic root of 6135150332 is about 1830.6629956609.
Adding to 6135150332 its reverse (2330515316), we get a palindrome (8465665648).
The spelling of 6135150332 in words is "six billion, one hundred thirty-five million, one hundred fifty thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.157 sec. • engine limits •