Base | Representation |
---|---|
bin | 10100000001001001… |
… | …11100111111001110 |
3 | 1000201222120111211110 |
4 | 22000210330333032 |
5 | 134002224331410 |
6 | 4534231432450 |
7 | 530215613211 |
oct | 120044747716 |
9 | 30658514743 |
10 | 10747105230 |
11 | 4615508254 |
12 | 20bb225726 |
13 | 1023710484 |
14 | 73d47d778 |
15 | 42d787720 |
hex | 28093cfce |
10747105230 has 32 divisors (see below), whose sum is σ = 25811460000. Its totient is φ = 2863849472.
The previous prime is 10747105207. The next prime is 10747105247. The reversal of 10747105230 is 3250174701.
10747105230 is digitally balanced in base 2 and base 5, because in such bases it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a Curzon number.
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, 84855 + ... + 169394.
It is an arithmetic number, because the mean of its divisors is an integer number (806608125).
Almost surely, 210747105230 is an apocalyptic number.
10747105230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10747105230 is an abundant number, since it is smaller than the sum of its proper divisors (15064354770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10747105230 is a wasteful number, since it uses less digits than its factorization.
10747105230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 255668.
The product of its (nonzero) digits is 5880, while the sum is 30.
Adding to 10747105230 its reverse (3250174701), we get a palindrome (13997279931).
The spelling of 10747105230 in words is "ten billion, seven hundred forty-seven million, one hundred five thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •