Base | Representation |
---|---|
bin | 1100110111000100011001… |
… | …1100100100000000111100 |
3 | 1212001210100211201220022220 |
4 | 3031301012130210000330 |
5 | 3323133124320343400 |
6 | 50023531424405340 |
7 | 2656411455555246 |
oct | 315610634440074 |
9 | 55053324656286 |
10 | 14140214231100 |
11 | 4561916331821 |
12 | 1704575176850 |
13 | 7b75550138b9 |
14 | 36c566305096 |
15 | 197c4583a7a0 |
hex | cdc4672403c |
14140214231100 has 72 divisors (see below), whose sum is σ = 41317426067568. Its totient is φ = 3733389888000.
The previous prime is 14140214231081. The next prime is 14140214231113. The reversal of 14140214231100 is 113241204141.
It is a happy number.
It is a super-3 number, since 3×141402142311003 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 233306569 + ... + 233367168.
Almost surely, 214140214231100 is an apocalyptic number.
14140214231100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14140214231100 is an abundant number, since it is smaller than the sum of its proper divisors (27177211836468).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14140214231100 is a wasteful number, since it uses less digits than its factorization.
14140214231100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 466673855 (or 466673848 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 24.
Adding to 14140214231100 its reverse (113241204141), we get a palindrome (14253455435241).
The spelling of 14140214231100 in words is "fourteen trillion, one hundred forty billion, two hundred fourteen million, two hundred thirty-one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •