Base | Representation |
---|---|
bin | 101111110000100010… |
… | …0011001101111101000 |
3 | 100210201121020210212201 |
4 | 1133201010121233220 |
5 | 3140020412303212 |
6 | 115040542345544 |
7 | 10260352646236 |
oct | 1374104315750 |
9 | 323647223781 |
10 | 102560275432 |
11 | 3a54a668a0a |
12 | 17a6328b2b4 |
13 | 9896084314 |
14 | 4d6d0c1956 |
15 | 2a03dbeb57 |
hex | 17e1119be8 |
102560275432 has 32 divisors (see below), whose sum is σ = 197679474720. Its totient is φ = 49848298560.
The previous prime is 102560275423. The next prime is 102560275459. The reversal of 102560275432 is 234572065201.
102560275432 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1025602754322 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (37).
It is a junction number, because it is equal to n+sod(n) for n = 102560275391 and 102560275400.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 164143 + ... + 481729.
It is an arithmetic number, because the mean of its divisors is an integer number (6177483585).
Almost surely, 2102560275432 is an apocalyptic number.
It is an amenable number.
102560275432 is a deficient number, since it is larger than the sum of its proper divisors (95119199288).
102560275432 is a wasteful number, since it uses less digits than its factorization.
102560275432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 318721 (or 318717 counting only the distinct ones).
The product of its (nonzero) digits is 100800, while the sum is 37.
The spelling of 102560275432 in words is "one hundred two billion, five hundred sixty million, two hundred seventy-five thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •