Base | Representation |
---|---|
bin | 10011000010101100… |
… | …00110010110101100 |
3 | 222101110121012010101 |
4 | 21201112012112230 |
5 | 131414104231430 |
6 | 4410232520444 |
7 | 511224031663 |
oct | 114126062654 |
9 | 28343535111 |
10 | 10223117740 |
11 | 4376757740 |
12 | 1b93850124 |
13 | c6bca9cc4 |
14 | 6cda41dda |
15 | 3ec781dca |
hex | 2615865ac |
10223117740 has 96 divisors (see below), whose sum is σ = 24501657600. Its totient is φ = 3546681600.
The previous prime is 10223117669. The next prime is 10223117761. The reversal of 10223117740 is 4771132201.
It is a junction number, because it is equal to n+sod(n) for n = 10223117699 and 10223117708.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2127861 + ... + 2132659.
It is an arithmetic number, because the mean of its divisors is an integer number (255225600).
Almost surely, 210223117740 is an apocalyptic number.
10223117740 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10223117740, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (12250828800).
10223117740 is an abundant number, since it is smaller than the sum of its proper divisors (14278539860).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10223117740 is a wasteful number, since it uses less digits than its factorization.
10223117740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5263 (or 5261 counting only the distinct ones).
The product of its (nonzero) digits is 2352, while the sum is 28.
Adding to 10223117740 its reverse (4771132201), we get a palindrome (14994249941).
The spelling of 10223117740 in words is "ten billion, two hundred twenty-three million, one hundred seventeen thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •