Base | Representation |
---|---|
bin | 1100101111100011111001… |
… | …1001111100111001110000 |
3 | 1211121110102201201210220221 |
4 | 3023320332121330321300 |
5 | 3314024444424410000 |
6 | 45444400443342424 |
7 | 2644164230410120 |
oct | 313707631747160 |
9 | 54543381653827 |
10 | 14011230310000 |
11 | 4512147268820 |
12 | 16a3578821a14 |
13 | 7a833a7b89b1 |
14 | 36620bb70c80 |
15 | 1946e6cd261a |
hex | cbe3e67ce70 |
14011230310000 has 200 divisors, whose sum is σ = 42293101175424. Its totient is φ = 4367136480000.
The previous prime is 14011230309907. The next prime is 14011230310057. The reversal of 14011230310000 is 1303211041.
It is a tau number, because it is divible by the number of its divisors (200).
It is a super-2 number, since 2×140112303100002 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 8328202 + ... + 9868201.
Almost surely, 214011230310000 is an apocalyptic number.
14011230310000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
14011230310000 is an abundant number, since it is smaller than the sum of its proper divisors (28281870865424).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14011230310000 is a wasteful number, since it uses less digits than its factorization.
14011230310000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18196449 (or 18196428 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 14011230310000 its reverse (1303211041), we get a palindrome (14012533521041).
The spelling of 14011230310000 in words is "fourteen trillion, eleven billion, two hundred thirty million, three hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •