Base | Representation |
---|---|
bin | 111100011101101… |
… | …011100000101011 |
3 | 2121200210112112000 |
4 | 330131223200223 |
5 | 4034142211410 |
6 | 244354222043 |
7 | 34065241224 |
oct | 7435534053 |
9 | 2550715460 |
10 | 1014413355 |
11 | 48067884a |
12 | 243884923 |
13 | 1322157b7 |
14 | 98a2024b |
15 | 5e0cbdc0 |
hex | 3c76b82b |
1014413355 has 32 divisors (see below), whose sum is σ = 1810321920. Its totient is φ = 538944480.
The previous prime is 1014413339. The next prime is 1014413357. The reversal of 1014413355 is 5533144101.
It is a happy number.
It is not a de Polignac number, because 1014413355 - 24 = 1014413339 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (1014413357) 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 31 ways as a sum of consecutive naturals, for example, 21220 + ... + 49790.
It is an arithmetic number, because the mean of its divisors is an integer number (56572560).
Almost surely, 21014413355 is an apocalyptic number.
1014413355 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1014413355 is a deficient number, since it is larger than the sum of its proper divisors (795908565).
1014413355 is a wasteful number, since it uses less digits than its factorization.
1014413355 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28848 (or 28842 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
The square root of 1014413355 is about 31849.8564360972. The cubic root of 1014413355 is about 1004.7815519867.
Adding to 1014413355 its reverse (5533144101), we get a palindrome (6547557456).
The spelling of 1014413355 in words is "one billion, fourteen million, four hundred thirteen thousand, three hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •