Base | Representation |
---|---|
bin | 1100101111100111111011… |
… | …0101010000110100111000 |
3 | 1211121120020001122021210011 |
4 | 3023321332311100310320 |
5 | 3314034203132230240 |
6 | 45445100015031304 |
7 | 2644233064046662 |
oct | 313717665206470 |
9 | 54546201567704 |
10 | 14012311211320 |
11 | 45126514189a4 |
12 | 16a381a80b534 |
13 | 7a8480710586 |
14 | 3662b153b532 |
15 | 19475bb446ea |
hex | cbe7ed50d38 |
14012311211320 has 32 divisors (see below), whose sum is σ = 31768369704720. Its totient is φ = 5562138799360.
The previous prime is 14012311211309. The next prime is 14012311211411. The reversal of 14012311211320 is 2311211321041.
It is a super-2 number, since 2×140123112113202 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14012311211291 and 14012311211300.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1337047357 + ... + 1337057836.
Almost surely, 214012311211320 is an apocalyptic number.
14012311211320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14012311211320 is an abundant number, since it is smaller than the sum of its proper divisors (17756058493400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14012311211320 is a wasteful number, since it uses less digits than its factorization.
14012311211320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2674105335 (or 2674105331 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 14012311211320 its reverse (2311211321041), we get a palindrome (16323522532361).
The spelling of 14012311211320 in words is "fourteen trillion, twelve billion, three hundred eleven million, two hundred eleven thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •