Base | Representation |
---|---|
bin | 1100110000110001110000… |
… | …1000110100110010000000 |
3 | 1211200110101021121211021210 |
4 | 3030030130020310302000 |
5 | 3314400300314401144 |
6 | 45502134401250120 |
7 | 2645534160664464 |
oct | 314143410646200 |
9 | 54613337554253 |
10 | 14032130231424 |
11 | 451aaa1776058 |
12 | 16a7630033940 |
13 | 7aa2bb7602c6 |
14 | 3672317924a4 |
15 | 19501ba61ab9 |
hex | cc31c234c80 |
14032130231424 has 128 divisors (see below), whose sum is σ = 38834780590080. Its totient is φ = 4484189537280.
The previous prime is 14032130231423. The next prime is 14032130231429. The reversal of 14032130231424 is 42413203123041.
It is a tau number, because it is divible by the number of its divisors (128).
It is a junction number, because it is equal to n+sod(n) for n = 14032130231391 and 14032130231400.
It is not an unprimeable number, because it can be changed into a prime (14032130231423) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4234564 + ... + 6782019.
It is an arithmetic number, because the mean of its divisors is an integer number (303396723360).
Almost surely, 214032130231424 is an apocalyptic number.
It is an amenable number.
14032130231424 is an abundant number, since it is smaller than the sum of its proper divisors (24802650358656).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14032130231424 is a wasteful number, since it uses less digits than its factorization.
14032130231424 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11016738 (or 11016726 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 30.
Adding to 14032130231424 its reverse (42413203123041), we get a palindrome (56445333354465).
The spelling of 14032130231424 in words is "fourteen trillion, thirty-two billion, one hundred thirty million, two hundred thirty-one thousand, four hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •