Base | Representation |
---|---|
bin | 10011100101011010… |
… | …10011110110111000 |
3 | 1000010202201121212222 |
4 | 21302231103312320 |
5 | 133013142240112 |
6 | 4455200223212 |
7 | 521362024142 |
oct | 116255236670 |
9 | 30122647788 |
10 | 10514415032 |
11 | 4506127700 |
12 | 205530ab08 |
13 | cb744b874 |
14 | 71a5cbc92 |
15 | 418122372 |
hex | 272b53db8 |
10514415032 has 24 divisors (see below), whose sum is σ = 21669690000. Its totient is φ = 4779279120.
The previous prime is 10514415031. The next prime is 10514415101. The reversal of 10514415032 is 23051441501.
It is a super-2 number, since 2×105144150322 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10514414992 and 10514415010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10514415031) by changing a digit.
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 5 ways as a sum of consecutive naturals, for example, 5430032 + ... + 5431967.
It is an arithmetic number, because the mean of its divisors is an integer number (902903750).
Almost surely, 210514415032 is an apocalyptic number.
It is an amenable number.
10514415032 is an abundant number, since it is smaller than the sum of its proper divisors (11155274968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10514415032 is a wasteful number, since it uses less digits than its factorization.
10514415032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10862027 (or 10862012 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 26.
Adding to 10514415032 its reverse (23051441501), we get a palindrome (33565856533).
The spelling of 10514415032 in words is "ten billion, five hundred fourteen million, four hundred fifteen thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •