Base | Representation |
---|---|
bin | 11010100010111110… |
… | …00100001101100100 |
3 | 1100210020122121201120 |
4 | 31101133010031210 |
5 | 213142003000400 |
6 | 10314113453540 |
7 | 1013115000462 |
oct | 152137041544 |
9 | 40706577646 |
10 | 14252000100 |
11 | 6053978688 |
12 | 2918b712b0 |
13 | 14618a1a70 |
14 | 992b53832 |
15 | 58630eca0 |
hex | 3517c4364 |
14252000100 has 144 divisors (see below), whose sum is σ = 44454446400. Its totient is φ = 3504499200.
The previous prime is 14252000093. The next prime is 14252000123. The reversal of 14252000100 is 100025241.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 14252000100.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 6788851 + ... + 6790949.
Almost surely, 214252000100 is an apocalyptic number.
14252000100 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 14252000100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22227223200).
14252000100 is an abundant number, since it is smaller than the sum of its proper divisors (30202446300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14252000100 is a wasteful number, since it uses less digits than its factorization.
14252000100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3870 (or 3863 counting only the distinct ones).
The product of its (nonzero) digits is 80, while the sum is 15.
Adding to 14252000100 its reverse (100025241), we get a palindrome (14352025341).
The spelling of 14252000100 in words is "fourteen billion, two hundred fifty-two million, one hundred", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •