Base | Representation |
---|---|
bin | 1101010100110000101001… |
… | …0010110100011001001000 |
3 | 1220212120000000200022110212 |
4 | 3111030022102310121020 |
5 | 3410012311333331013 |
6 | 51054131400500252 |
7 | 3041310146422562 |
oct | 325141222643110 |
9 | 56776000608425 |
10 | 14650306152008 |
11 | 473918398781a |
12 | 17873b1a7a688 |
13 | 823696bc41b7 |
14 | 389115978332 |
15 | 1a614c4376a8 |
hex | d530a4b4648 |
14650306152008 has 108 divisors (see below), whose sum is σ = 30512898538395. Its totient is φ = 6592605831680.
The previous prime is 14650306151959. The next prime is 14650306152037. The reversal of 14650306152008 is 80025160305641.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It can be written as a sum of positive squares in 5 ways, for example, as 6898302637444 + 7752003514564 = 2626462^2 + 2784242^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=2706502.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 4232967398 + ... + 4232970858.
Almost surely, 214650306152008 is an apocalyptic number.
It is an amenable number.
14650306152008 is an abundant number, since it is smaller than the sum of its proper divisors (15862592386387).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14650306152008 is an frugal number, since it uses more digits than its factorization.
14650306152008 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7008 (or 3503 counting only the distinct ones).
The product of its (nonzero) digits is 172800, while the sum is 41.
Adding to 14650306152008 its reverse (80025160305641), we get a palindrome (94675466457649).
The spelling of 14650306152008 in words is "fourteen trillion, six hundred fifty billion, three hundred six million, one hundred fifty-two thousand, eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •