Base | Representation |
---|---|
bin | 1100110001001111000111… |
… | …1111010000001000110011 |
3 | 1211201012201122110122111112 |
4 | 3030103301333100020303 |
5 | 3320012421312413210 |
6 | 45505520512503535 |
7 | 2646233416351544 |
oct | 314236177201063 |
9 | 54635648418445 |
10 | 14040013013555 |
11 | 4523377361a31 |
12 | 16a906bb4abab |
13 | 7aac76911929 |
14 | 36777c6664cb |
15 | 19532db05d05 |
hex | cc4f1fd0233 |
14040013013555 has 8 divisors (see below), whose sum is σ = 17734753280400. Its totient is φ = 10640851968096.
The previous prime is 14040013013519. The next prime is 14040013013639. The reversal of 14040013013555 is 55531031004041.
14040013013555 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 14040013013555 - 224 = 14039996236339 is a prime.
It is a super-2 number, since 2×140400130135552 (a number of 27 digits) contains 22 as substring.
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, 73894805240 + ... + 73894805429.
It is an arithmetic number, because the mean of its divisors is an integer number (2216844160050).
Almost surely, 214040013013555 is an apocalyptic number.
14040013013555 is a deficient number, since it is larger than the sum of its proper divisors (3694740266845).
14040013013555 is a wasteful number, since it uses less digits than its factorization.
14040013013555 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 147789610693.
The product of its (nonzero) digits is 18000, while the sum is 32.
Adding to 14040013013555 its reverse (55531031004041), we get a palindrome (69571044017596).
The spelling of 14040013013555 in words is "fourteen trillion, forty billion, thirteen million, thirteen thousand, five hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •