Base | Representation |
---|---|
bin | 1101110000100110110000… |
… | …1101010111110000111100 |
3 | 1222120021210102202222210110 |
4 | 3130021230031113300330 |
5 | 3440332024201323202 |
6 | 52102005132310020 |
7 | 3121004022312054 |
oct | 334115415276074 |
9 | 58507712688713 |
10 | 15128690261052 |
11 | 4903050280425 |
12 | 184405b912310 |
13 | 859824959544 |
14 | 3a4338046564 |
15 | 1b37ea51226c |
hex | dc26c357c3c |
15128690261052 has 48 divisors (see below), whose sum is σ = 35412767268480. Its totient is φ = 5026827774912.
The previous prime is 15128690261023. The next prime is 15128690261063. The reversal of 15128690261052 is 25016209682151.
It is a junction number, because it is equal to n+sod(n) for n = 15128690260992 and 15128690261010.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 210473623 + ... + 210545489.
It is an arithmetic number, because the mean of its divisors is an integer number (737765984760).
Almost surely, 215128690261052 is an apocalyptic number.
15128690261052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
15128690261052 is an abundant number, since it is smaller than the sum of its proper divisors (20284077007428).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15128690261052 is a wasteful number, since it uses less digits than its factorization.
15128690261052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127530 (or 127528 counting only the distinct ones).
The product of its (nonzero) digits is 518400, while the sum is 48.
The spelling of 15128690261052 in words is "fifteen trillion, one hundred twenty-eight billion, six hundred ninety million, two hundred sixty-one thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •