Base | Representation |
---|---|
bin | 11000001110111100… |
… | …11001101101100000 |
3 | 1020120201012022220121 |
4 | 30013132121231200 |
5 | 203121114441112 |
6 | 5551000050024 |
7 | 640256553604 |
oct | 140736315540 |
9 | 36521168817 |
10 | 13010312032 |
11 | 5576a88aa3 |
12 | 2631163914 |
13 | 12c45725b3 |
14 | 8b5c91504 |
15 | 5122dc407 |
hex | 307799b60 |
13010312032 has 12 divisors (see below), whose sum is σ = 25614051876. Its totient is φ = 6505156000.
The previous prime is 13010312023. The next prime is 13010312033. The reversal of 13010312032 is 23021301031.
13010312032 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a junction number, because it is equal to n+sod(n) for n = 13010311997 and 13010312015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13010312033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 203286094 + ... + 203286157.
It is an arithmetic number, because the mean of its divisors is an integer number (2134504323).
Almost surely, 213010312032 is an apocalyptic number.
It is an amenable number.
13010312032 is a deficient number, since it is larger than the sum of its proper divisors (12603739844).
13010312032 is an equidigital number, since it uses as much as digits as its factorization.
13010312032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 406572261 (or 406572253 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 13010312032 its reverse (23021301031), we get a palindrome (36031613063).
The spelling of 13010312032 in words is "thirteen billion, ten million, three hundred twelve thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •