Base | Representation |
---|---|
bin | 11010000110001111… |
… | …11011100010101110 |
3 | 1100011110021022011100 |
4 | 31003013323202232 |
5 | 212143312214004 |
6 | 10234145303530 |
7 | 1004130665451 |
oct | 150307734256 |
9 | 40143238140 |
10 | 14011054254 |
11 | 5a3a96948a |
12 | 2870334ba6 |
13 | 14239ac562 |
14 | 96cb53498 |
15 | 5700b8739 |
hex | 3431fb8ae |
14011054254 has 96 divisors (see below), whose sum is σ = 33554566656. Its totient is φ = 4206504960.
The previous prime is 14011054231. The next prime is 14011054273. The reversal of 14011054254 is 45245011041.
14011054254 is a `hidden beast` number, since 1 + 4 + 0 + 110 + 542 + 5 + 4 = 666.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 680499 + ... + 700785.
It is an arithmetic number, because the mean of its divisors is an integer number (349526736).
Almost surely, 214011054254 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 14011054254, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16777283328).
14011054254 is an abundant number, since it is smaller than the sum of its proper divisors (19543512402).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14011054254 is a wasteful number, since it uses less digits than its factorization.
14011054254 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20410 (or 20407 counting only the distinct ones).
The product of its (nonzero) digits is 3200, while the sum is 27.
Adding to 14011054254 its reverse (45245011041), we get a palindrome (59256065295).
The spelling of 14011054254 in words is "fourteen billion, eleven million, fifty-four thousand, two hundred fifty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •