Base | Representation |
---|---|
bin | 11010000110010111… |
… | …00011110001001111 |
3 | 1100011112001121222000 |
4 | 31003023203301033 |
5 | 212144033133310 |
6 | 10234221523343 |
7 | 1004142036600 |
oct | 150313436117 |
9 | 40145047860 |
10 | 14012005455 |
11 | 5a404590a8 |
12 | 2870713553 |
13 | 1423c534b6 |
14 | 96cd1dda7 |
15 | 5702054c0 |
hex | 3432e3c4f |
14012005455 has 96 divisors (see below), whose sum is σ = 30681996480. Its totient is φ = 6028646400.
The previous prime is 14012005453. The next prime is 14012005463. The reversal of 14012005455 is 55450021041.
14012005455 is a `hidden beast` number, since 1 + 4 + 0 + 1 + 200 + 5 + 455 = 666.
It is not a de Polignac number, because 14012005455 - 21 = 14012005453 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14012005451) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 50155 + ... + 174755.
It is an arithmetic number, because the mean of its divisors is an integer number (319604130).
Almost surely, 214012005455 is an apocalyptic number.
14012005455 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
14012005455 is an abundant number, since it is smaller than the sum of its proper divisors (16669991025).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14012005455 is a wasteful number, since it uses less digits than its factorization.
14012005455 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 124646 (or 124633 counting only the distinct ones).
The product of its (nonzero) digits is 4000, while the sum is 27.
Adding to 14012005455 its reverse (55450021041), we get a palindrome (69462026496).
The spelling of 14012005455 in words is "fourteen billion, twelve million, five thousand, four hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •