Base | Representation |
---|---|
bin | 11100110101110001… |
… | …10011101001010000 |
3 | 1110222001220112002020 |
4 | 32122320303221100 |
5 | 223202233003002 |
6 | 11040224451440 |
7 | 1055460306651 |
oct | 163270635120 |
9 | 43861815066 |
10 | 15483484752 |
11 | 662602929a |
12 | 3001479b80 |
13 | 15c9a6abc8 |
14 | a6c51b528 |
15 | 6094b92bc |
hex | 39ae33a50 |
15483484752 has 80 divisors (see below), whose sum is σ = 40301640768. Its totient is φ = 5122206720.
The previous prime is 15483484721. The next prime is 15483484817. The reversal of 15483484752 is 25748438451.
15483484752 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 15483484695 and 15483484704.
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, 10804228 + ... + 10805660.
Almost surely, 215483484752 is an apocalyptic number.
15483484752 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
15483484752 is an abundant number, since it is smaller than the sum of its proper divisors (24818156016).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15483484752 is a wasteful number, since it uses less digits than its factorization.
15483484752 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2988 (or 2982 counting only the distinct ones).
The product of its digits is 4300800, while the sum is 51.
The spelling of 15483484752 in words is "fifteen billion, four hundred eighty-three million, four hundred eighty-four thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.128 sec. • engine limits •