Base | Representation |
---|---|
bin | 11000011101001110… |
… | …01000011011001000 |
3 | 1020220001111012020000 |
4 | 30032213020123020 |
5 | 203342242303112 |
6 | 10010514203000 |
7 | 643242336003 |
oct | 141647103310 |
9 | 36801435200 |
10 | 13130041032 |
11 | 5628625189 |
12 | 2665283460 |
13 | 1313303064 |
14 | 8c7b3a53a |
15 | 51ca8c7dc |
hex | 30e9c86c8 |
13130041032 has 40 divisors (see below), whose sum is σ = 36776274150. Its totient is φ = 4376680128.
The previous prime is 13130041007. The next prime is 13130041049. The reversal of 13130041032 is 23014003131.
It can be written as a sum of positive squares in only one way, i.e., 11366544996 + 1763496036 = 106614^2 + 41994^2 .
It is a super-3 number, since 3×131300410323 (a number of 31 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 13130040996 and 13130041014.
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 10130557 + ... + 10131852.
Almost surely, 213130041032 is an apocalyptic number.
13130041032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13130041032 is an abundant number, since it is smaller than the sum of its proper divisors (23646233118).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13130041032 is a wasteful number, since it uses less digits than its factorization.
13130041032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20262427 (or 20262414 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 13130041032 its reverse (23014003131), we get a palindrome (36144044163).
The spelling of 13130041032 in words is "thirteen billion, one hundred thirty million, forty-one thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •