Base | Representation |
---|---|
bin | 1100111101000011011001… |
… | …0101110011101101001000 |
3 | 1212102121201210000200101120 |
4 | 3033100312111303231020 |
5 | 3331324202422140013 |
6 | 50143053214315240 |
7 | 3000011251663143 |
oct | 317206625635510 |
9 | 55377653020346 |
10 | 14243023240008 |
11 | 45a1483338892 |
12 | 17204877b8b20 |
13 | 7c415a785c94 |
14 | 37351a45305a |
15 | 19a76148e123 |
hex | cf436573b48 |
14243023240008 has 32 divisors (see below), whose sum is σ = 35607671828160. Its totient is φ = 4747659249600.
The previous prime is 14243023240001. The next prime is 14243023240049. The reversal of 14243023240008 is 80004232034241.
It is a super-2 number, since 2×142430232400082 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (14243023240001) 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 7 ways as a sum of consecutive naturals, for example, 8746941 + ... + 10246707.
It is an arithmetic number, because the mean of its divisors is an integer number (1112739744630).
Almost surely, 214243023240008 is an apocalyptic number.
It is an amenable number.
14243023240008 is an abundant number, since it is smaller than the sum of its proper divisors (21364648588152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14243023240008 is a wasteful number, since it uses less digits than its factorization.
14243023240008 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1895477 (or 1895473 counting only the distinct ones).
The product of its (nonzero) digits is 36864, while the sum is 33.
Adding to 14243023240008 its reverse (80004232034241), we get a palindrome (94247255274249).
The spelling of 14243023240008 in words is "fourteen trillion, two hundred forty-three billion, twenty-three million, two hundred forty thousand, eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •