Base | Representation |
---|---|
bin | 10011001101100011… |
… | …10000100100101000 |
3 | 222121211002102102211 |
4 | 21212301300210220 |
5 | 132110422122012 |
6 | 4423250134504 |
7 | 513411501133 |
oct | 114661604450 |
9 | 28554072384 |
10 | 10314254632 |
11 | 4413145190 |
12 | 1bba281434 |
13 | c84b39566 |
14 | 6dbba721a |
15 | 4057856a7 |
hex | 266c70928 |
10314254632 has 64 divisors (see below), whose sum is σ = 21437343360. Its totient is φ = 4613011200.
The previous prime is 10314254627. The next prime is 10314254659. The reversal of 10314254632 is 23645241301.
It is a super-2 number, since 2×103142546322 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10314254594 and 10314254603.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3828678 + ... + 3831370.
It is an arithmetic number, because the mean of its divisors is an integer number (334958490).
Almost surely, 210314254632 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10314254632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10718671680).
10314254632 is an abundant number, since it is smaller than the sum of its proper divisors (11123088728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10314254632 is a wasteful number, since it uses less digits than its factorization.
10314254632 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3394 (or 3390 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 31.
Adding to 10314254632 its reverse (23645241301), we get a palindrome (33959495933).
The spelling of 10314254632 in words is "ten billion, three hundred fourteen million, two hundred fifty-four thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.130 sec. • engine limits •