Base | Representation |
---|---|
bin | 11010111010111110… |
… | …01100101000000001 |
3 | 1101022021112211011100 |
4 | 31131133030220001 |
5 | 214100030024103 |
6 | 10350105405013 |
7 | 1021111354110 |
oct | 153537145001 |
9 | 41267484140 |
10 | 14453361153 |
11 | 6147600180 |
12 | 2974499769 |
13 | 149451470a |
14 | 9b17abc77 |
15 | 598d375a3 |
hex | 35d7cca01 |
14453361153 has 24 divisors (see below), whose sum is σ = 26028565056. Its totient is φ = 7508239200.
The previous prime is 14453361151. The next prime is 14453361179. The reversal of 14453361153 is 35116335441.
14453361153 is a `hidden beast` number, since 1 + 4 + 4 + 5 + 33 + 611 + 5 + 3 = 666.
14453361153 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 14453361153 - 21 = 14453361151 is a prime.
It is not an unprimeable number, because it can be changed into a prime (14453361151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 10427418 + ... + 10428803.
It is an arithmetic number, because the mean of its divisors is an integer number (1084523544).
Almost surely, 214453361153 is an apocalyptic number.
It is an amenable number.
14453361153 is a deficient number, since it is larger than the sum of its proper divisors (11575203903).
14453361153 is a wasteful number, since it uses less digits than its factorization.
14453361153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20856245 (or 20856242 counting only the distinct ones).
The product of its digits is 64800, while the sum is 36.
Adding to 14453361153 its reverse (35116335441), we get a palindrome (49569696594).
The spelling of 14453361153 in words is "fourteen billion, four hundred fifty-three million, three hundred sixty-one thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •