Base | Representation |
---|---|
bin | 11011000011100010… |
… | …01111011010000000 |
3 | 1101111021201121112101 |
4 | 31201301033122000 |
5 | 214221422400000 |
6 | 10401153240144 |
7 | 1022643106603 |
oct | 154161173200 |
9 | 41437647471 |
10 | 14525200000 |
11 | 6184107823 |
12 | 2994563054 |
13 | 14a63781cc |
14 | 9bb14c33a |
15 | 5a02c7e6a |
hex | 361c4f680 |
14525200000 has 96 divisors (see below), whose sum is σ = 36169833420. Its totient is φ = 5809920000.
The previous prime is 14525199937. The next prime is 14525200003. The reversal of 14525200000 is 252541.
It can be written as a sum of positive squares in 6 ways, for example, as 4158702144 + 10366497856 = 64488^2 + 101816^2 .
It is not an unprimeable number, because it can be changed into a prime (14525200003) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 381844 + ... + 418156.
Almost surely, 214525200000 is an apocalyptic number.
14525200000 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 14525200000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18084916710).
14525200000 is an abundant number, since it is smaller than the sum of its proper divisors (21644633420).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14525200000 is an frugal number, since it uses more digits than its factorization.
14525200000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36352 (or 36320 counting only the distinct ones).
The product of its (nonzero) digits is 400, while the sum is 19.
Adding to 14525200000 its reverse (252541), we get a palindrome (14525452541).
The spelling of 14525200000 in words is "fourteen billion, five hundred twenty-five million, two hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •