Base | Representation |
---|---|
bin | 11010001000100011… |
… | …11011100100111010 |
3 | 1100012210202212022021 |
4 | 31010101323210322 |
5 | 212213243444200 |
6 | 10240121145054 |
7 | 1004454611635 |
oct | 150421734472 |
9 | 40183685267 |
10 | 14030453050 |
11 | 5a4a909049 |
12 | 287692b18a |
13 | 1427a12133 |
14 | 971562c1c |
15 | 571b4b41a |
hex | 34447b93a |
14030453050 has 24 divisors (see below), whose sum is σ = 26110633500. Its totient is φ = 5609172480.
The previous prime is 14030452999. The next prime is 14030453147. The reversal of 14030453050 is 5035403041.
14030453050 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 6 ways, for example, as 9681182449 + 4349270601 = 98393^2 + 65949^2 .
It is a super-2 number, since 2×140304530502 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 20176 + ... + 168724.
Almost surely, 214030453050 is an apocalyptic number.
14030453050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14030453050 is a deficient number, since it is larger than the sum of its proper divisors (12080180450).
14030453050 is a wasteful number, since it uses less digits than its factorization.
14030453050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150450 (or 150445 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 25.
Adding to 14030453050 its reverse (5035403041), we get a palindrome (19065856091).
The spelling of 14030453050 in words is "fourteen billion, thirty million, four hundred fifty-three thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •