Base | Representation |
---|---|
bin | 1100101111101001011000… |
… | …0001110111110001010100 |
3 | 1211121121020011221202001010 |
4 | 3023322112001313301110 |
5 | 3314041002300030112 |
6 | 45445202400332220 |
7 | 2644245531042042 |
oct | 313722601676124 |
9 | 54547204852033 |
10 | 14012700392532 |
11 | 4512831074566 |
12 | 16a3909014070 |
13 | 7a851323470a |
14 | 36630b0c7392 |
15 | 194780dbc63c |
hex | cbe96077c54 |
14012700392532 has 48 divisors (see below), whose sum is σ = 33608019614400. Its totient is φ = 4542214430208.
The previous prime is 14012700392531. The next prime is 14012700392591. The reversal of 14012700392532 is 23529300721041.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14012700392531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 97417282 + ... + 97561017.
It is an arithmetic number, because the mean of its divisors is an integer number (700167075300).
Almost surely, 214012700392532 is an apocalyptic number.
14012700392532 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
14012700392532 is an abundant number, since it is smaller than the sum of its proper divisors (19595319221868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14012700392532 is a wasteful number, since it uses less digits than its factorization.
14012700392532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 194978472 (or 194978470 counting only the distinct ones).
The product of its (nonzero) digits is 90720, while the sum is 39.
The spelling of 14012700392532 in words is "fourteen trillion, twelve billion, seven hundred million, three hundred ninety-two thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •