Base | Representation |
---|---|
bin | 1101001000110100001110… |
… | …1001100111100110000010 |
3 | 1220010221100112220202110011 |
4 | 3102031003221213212002 |
5 | 3343132041130000002 |
6 | 50415554131055134 |
7 | 3020424202051423 |
oct | 322150351474602 |
9 | 56127315822404 |
10 | 14445110000002 |
11 | 466a156014720 |
12 | 17536861414aa |
13 | 80a225208786 |
14 | 37d20b73564a |
15 | 1a0b3cc128d7 |
hex | d2343a67982 |
14445110000002 has 8 divisors (see below), whose sum is σ = 23637452727312. Its totient is φ = 6565959090900.
The previous prime is 14445109999927. The next prime is 14445110000047. The reversal of 14445110000002 is 20000001154441.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×144451100000022 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22), and also a Moran number because the ratio is a prime number: 656595909091 = 14445110000002 / (1 + 4 + 4 + 4 + 5 + 1 + 1 + 0 + 0 + 0 + 0 + 0 + 0 + 2).
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 328297954524 + ... + 328297954567.
It is an arithmetic number, because the mean of its divisors is an integer number (2954681590914).
Almost surely, 214445110000002 is an apocalyptic number.
14445110000002 is a deficient number, since it is larger than the sum of its proper divisors (9192342727310).
14445110000002 is a wasteful number, since it uses less digits than its factorization.
14445110000002 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 656595909104.
The product of its (nonzero) digits is 640, while the sum is 22.
Adding to 14445110000002 its reverse (20000001154441), we get a palindrome (34445111154443).
The spelling of 14445110000002 in words is "fourteen trillion, four hundred forty-five billion, one hundred ten million, two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •