Base | Representation |
---|---|
bin | 101010011010001… |
… | …0110110011101011 |
3 | 10200011122110012000 |
4 | 1110310112303223 |
5 | 10403242323201 |
6 | 353112022043 |
7 | 50156252160 |
oct | 12464266353 |
9 | 3604573160 |
10 | 1423011051 |
11 | 6702862a0 |
12 | 338691923 |
13 | 198a77597 |
14 | d6dc2067 |
15 | 84ddcd86 |
hex | 54d16ceb |
1423011051 has 32 divisors (see below), whose sum is σ = 2628364800. Its totient is φ = 739225440.
The previous prime is 1423011041. The next prime is 1423011071. The reversal of 1423011051 is 1501103241.
It is not a de Polignac number, because 1423011051 - 26 = 1423010987 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1423011001) 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, 340156 + ... + 344313.
It is an arithmetic number, because the mean of its divisors is an integer number (82136400).
Almost surely, 21423011051 is an apocalyptic number.
1423011051 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1423011051 is a deficient number, since it is larger than the sum of its proper divisors (1205353749).
1423011051 is a wasteful number, since it uses less digits than its factorization.
1423011051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 684496 (or 684490 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 18.
The square root of 1423011051 is about 37722.8187043333. The cubic root of 1423011051 is about 1124.7847623784.
Adding to 1423011051 its reverse (1501103241), we get a palindrome (2924114292).
It can be divided in two parts, 14230 and 11051, that added together give a square (25281 = 1592).
The spelling of 1423011051 in words is "one billion, four hundred twenty-three million, eleven thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •