Base | Representation |
---|---|
bin | 10010110000001100… |
… | …11011000100111000 |
3 | 221222122202001221000 |
4 | 21120012123010320 |
5 | 131104402411433 |
6 | 4343012245000 |
7 | 504331462440 |
oct | 113006330470 |
9 | 27878661830 |
10 | 10068013368 |
11 | 42a7149506 |
12 | 1b4b910760 |
13 | c45b1197a |
14 | 6b71c9120 |
15 | 3ddd45113 |
hex | 25819b138 |
10068013368 has 128 divisors (see below), whose sum is σ = 32123520000. Its totient is φ = 2862034560.
The previous prime is 10068013331. The next prime is 10068013387. The reversal of 10068013368 is 86331086001.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
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, 284158 + ... + 317618.
It is an arithmetic number, because the mean of its divisors is an integer number (250965000).
Almost surely, 210068013368 is an apocalyptic number.
10068013368 is a gapful number since it is divisible by the number (18) 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 10068013368, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16061760000).
10068013368 is an abundant number, since it is smaller than the sum of its proper divisors (22055506632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10068013368 is a wasteful number, since it uses less digits than its factorization.
10068013368 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33682 (or 33672 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 36.
Adding to 10068013368 its reverse (86331086001), we get a palindrome (96399099369).
The spelling of 10068013368 in words is "ten billion, sixty-eight million, thirteen thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •