Base | Representation |
---|---|
bin | 11010101011110000… |
… | …01100011001100100 |
3 | 1100222101022202122001 |
4 | 31111320030121210 |
5 | 213314334233400 |
6 | 10325305215044 |
7 | 1015001256562 |
oct | 152570143144 |
9 | 40871282561 |
10 | 14325696100 |
11 | 6091533571 |
12 | 2939791484 |
13 | 1473c35971 |
14 | 99c858a32 |
15 | 58ca1aa6a |
hex | 355e0c664 |
14325696100 has 27 divisors (see below), whose sum is σ = 31089358027. Its totient is φ = 5729799680.
The previous prime is 14325696083. The next prime is 14325696103. The reversal of 14325696100 is 169652341.
The square root of 14325696100 is 119690.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 4957004836 + 9368691264 = 70406^2 + 96792^2 .
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 14325696100.
It is not an unprimeable number, because it can be changed into a prime (14325696103) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 1190916 + ... + 1202884.
Almost surely, 214325696100 is an apocalyptic number.
14325696100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14325696100 is the 119690-th square number.
It is an amenable number.
14325696100 is an abundant number, since it is smaller than the sum of its proper divisors (16763661927).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14325696100 is an frugal number, since it uses more digits than its factorization.
14325696100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23952 (or 11976 counting only the distinct ones).
The product of its (nonzero) digits is 38880, while the sum is 37.
The spelling of 14325696100 in words is "fourteen billion, three hundred twenty-five million, six hundred ninety-six thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •