Base | Representation |
---|---|
bin | 101010010101010… |
… | …0011001100001010 |
3 | 10122222210211211010 |
4 | 1110222203030022 |
5 | 10402113042310 |
6 | 352540544350 |
7 | 50125354311 |
oct | 12452431412 |
9 | 3588724733 |
10 | 1420440330 |
11 | 66988a931 |
12 | 3378520b6 |
13 | 19838744a |
14 | d6913278 |
15 | 84a81320 |
hex | 54aa330a |
1420440330 has 32 divisors (see below), whose sum is σ = 3414040128. Its totient is φ = 378230400.
The previous prime is 1420440299. The next prime is 1420440331. The reversal of 1420440330 is 330440241.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1420440297 and 1420440306.
It is not an unprimeable number, because it can be changed into a prime (1420440331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13531 + ... + 54990.
It is an arithmetic number, because the mean of its divisors is an integer number (106688754).
Almost surely, 21420440330 is an apocalyptic number.
1420440330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1420440330 is an abundant number, since it is smaller than the sum of its proper divisors (1993599798).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1420440330 is a wasteful number, since it uses less digits than its factorization.
1420440330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69222.
The product of its (nonzero) digits is 1152, while the sum is 21.
The square root of 1420440330 is about 37688.7294824328. The cubic root of 1420440330 is about 1124.1070326303.
Adding to 1420440330 its reverse (330440241), we get a palindrome (1750880571).
The spelling of 1420440330 in words is "one billion, four hundred twenty million, four hundred forty thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •