Base | Representation |
---|---|
bin | 11000001110111100… |
… | …00011101111010000 |
3 | 1020120201000202110021 |
4 | 30013132003233100 |
5 | 203121104101112 |
6 | 5550554113224 |
7 | 640256030323 |
oct | 140736035720 |
9 | 36521022407 |
10 | 13010222032 |
11 | 5576a27415 |
12 | 263111b814 |
13 | 12c4540642 |
14 | 8b5c6a7ba |
15 | 5122c0907 |
hex | 307783bd0 |
13010222032 has 40 divisors (see below), whose sum is σ = 26736636960. Its totient is φ = 6115674240.
The previous prime is 13010222003. The next prime is 13010222041. The reversal of 13010222032 is 23022201031.
13010222032 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 = 13010221997 and 13010222015.
It is a congruent number.
It is an unprimeable number.
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 in 7 ways as a sum of consecutive naturals, for example, 123523 + ... + 203170.
It is an arithmetic number, because the mean of its divisors is an integer number (668415924).
Almost surely, 213010222032 is an apocalyptic number.
It is an amenable number.
13010222032 is an abundant number, since it is smaller than the sum of its proper divisors (13726414928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13010222032 is a wasteful number, since it uses less digits than its factorization.
13010222032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 326851 (or 326845 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 13010222032 its reverse (23022201031), we get a palindrome (36032423063).
The spelling of 13010222032 in words is "thirteen billion, ten million, two hundred twenty-two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •