Base | Representation |
---|---|
bin | 1101000010000111110111… |
… | …0001011100011101110000 |
3 | 1212201221112202211222122120 |
4 | 3100201331301130131300 |
5 | 3334241041434404404 |
6 | 50251100002034240 |
7 | 3006213520562601 |
oct | 320417561343560 |
9 | 55657482758576 |
10 | 14330121013104 |
11 | 46254087a9946 |
12 | 1735334648980 |
13 | 7cc42b237a20 |
14 | 37781db19da8 |
15 | 19cb5cb3b9d9 |
hex | d087dc5c770 |
14330121013104 has 40 divisors (see below), whose sum is σ = 39867131538192. Its totient is φ = 4409268003840.
The previous prime is 14330121013063. The next prime is 14330121013111. The reversal of 14330121013104 is 40131012103341.
It is a happy number.
14330121013104 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×143301210131042 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
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, 11482468137 + ... + 11482469384.
Almost surely, 214330121013104 is an apocalyptic number.
It is an amenable number.
14330121013104 is an abundant number, since it is smaller than the sum of its proper divisors (25537010525088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14330121013104 is a wasteful number, since it uses less digits than its factorization.
14330121013104 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22964937545 (or 22964937539 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 24.
Adding to 14330121013104 its reverse (40131012103341), we get a palindrome (54461133116445).
The spelling of 14330121013104 in words is "fourteen trillion, three hundred thirty billion, one hundred twenty-one million, thirteen thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •