Base | Representation |
---|---|
bin | 11000011100000011… |
… | …01011001100110000 |
3 | 1020212101000100001011 |
4 | 30032001223030300 |
5 | 203332234101000 |
6 | 10005523520304 |
7 | 643063022044 |
oct | 141601531460 |
9 | 36771010034 |
10 | 13120222000 |
11 | 5623028a86 |
12 | 2661b29094 |
13 | 1311275992 |
14 | 8c6702024 |
15 | 51bc9d2ba |
hex | 30e06b330 |
13120222000 has 160 divisors (see below), whose sum is σ = 33519283200. Its totient is φ = 4953312000.
The previous prime is 13120221997. The next prime is 13120222007. The reversal of 13120222000 is 22202131.
It is not an unprimeable number, because it can be changed into a prime (13120222007) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 14401545 + ... + 14402455.
It is an arithmetic number, because the mean of its divisors is an integer number (209495520).
Almost surely, 213120222000 is an apocalyptic number.
13120222000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13120222000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16759641600).
13120222000 is an abundant number, since it is smaller than the sum of its proper divisors (20399061200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13120222000 is a wasteful number, since it uses less digits than its factorization.
13120222000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1332 (or 1316 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 13.
Adding to 13120222000 its reverse (22202131), we get a palindrome (13142424131).
The spelling of 13120222000 in words is "thirteen billion, one hundred twenty million, two hundred twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •