Base | Representation |
---|---|
bin | 10011001000110001… |
… | …01010100000011100 |
3 | 222112000120110111000 |
4 | 21210120222200130 |
5 | 132020133344011 |
6 | 4415254030300 |
7 | 512413410513 |
oct | 114430524034 |
9 | 28460513430 |
10 | 10274121756 |
11 | 43a2523818 |
12 | 1ba8948390 |
13 | c797273b2 |
14 | 6d671b67a |
15 | 401ea9356 |
hex | 26462a81c |
10274121756 has 48 divisors (see below), whose sum is σ = 26742804480. Its totient is φ = 3411054000.
The previous prime is 10274121733. The next prime is 10274121787. The reversal of 10274121756 is 65712147201.
It is a super-2 number, since 2×102741217562 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 10274121756.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 162396 + ... + 216611.
It is an arithmetic number, because the mean of its divisors is an integer number (557141760).
Almost surely, 210274121756 is an apocalyptic number.
It is an amenable number.
10274121756 is an abundant number, since it is smaller than the sum of its proper divisors (16468682724).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10274121756 is a wasteful number, since it uses less digits than its factorization.
10274121756 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 379271 (or 379263 counting only the distinct ones).
The product of its (nonzero) digits is 23520, while the sum is 36.
Adding to 10274121756 its reverse (65712147201), we get a palindrome (75986268957).
The spelling of 10274121756 in words is "ten billion, two hundred seventy-four million, one hundred twenty-one thousand, seven hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •