Base | Representation |
---|---|
bin | 10010111001001010… |
… | …10100000100100000 |
3 | 222011220020222000211 |
4 | 21130211110010200 |
5 | 131233131020000 |
6 | 4354300223504 |
7 | 506233642654 |
oct | 113445240440 |
9 | 28156228024 |
10 | 10143220000 |
11 | 4335646351 |
12 | 1b70b3ab94 |
13 | c58584334 |
14 | 6c31a4a64 |
15 | 3e574d7ba |
hex | 25c954120 |
10143220000 has 120 divisors (see below), whose sum is σ = 26422601436. Its totient is φ = 3818496000.
The previous prime is 10143219979. The next prime is 10143220001. The reversal of 10143220000 is 2234101.
It can be written as a sum of positive squares in 10 ways, for example, as 301786384 + 9841433616 = 17372^2 + 99204^2 .
It is not an unprimeable number, because it can be changed into a prime (10143220001) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 325084 + ... + 354916.
Almost surely, 210143220000 is an apocalyptic number.
10143220000 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 10143220000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13211300718).
10143220000 is an abundant number, since it is smaller than the sum of its proper divisors (16279381436).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10143220000 is an equidigital number, since it uses as much as digits as its factorization.
10143220000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29880 (or 29857 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 13.
Adding to 10143220000 its reverse (2234101), we get a palindrome (10145454101).
The spelling of 10143220000 in words is "ten billion, one hundred forty-three million, two hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •