Base | Representation |
---|---|
bin | 10101000111101000100… |
… | …101001010010111000110 |
3 | 12010202002000100101210200 |
4 | 111013220211022113012 |
5 | 142234233321102010 |
6 | 3030415405031330 |
7 | 206565500515644 |
oct | 25075045122706 |
9 | 5122060311720 |
10 | 1451306034630 |
11 | 50a54a46a501 |
12 | 1b5333555546 |
13 | a6b1c11554a |
14 | 5035a58c194 |
15 | 27b424d7cc0 |
hex | 151e894a5c6 |
1451306034630 has 48 divisors (see below), whose sum is σ = 3790316799360. Its totient is φ = 385279444224.
The previous prime is 1451306034583. The next prime is 1451306034631. The reversal of 1451306034630 is 364306031541.
1451306034630 is a `hidden beast` number, since 1 + 4 + 5 + 1 + 3 + 0 + 603 + 46 + 3 + 0 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1451306034631) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 36136035 + ... + 36176174.
It is an arithmetic number, because the mean of its divisors is an integer number (78964933320).
Almost surely, 21451306034630 is an apocalyptic number.
1451306034630 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1451306034630 is an abundant number, since it is smaller than the sum of its proper divisors (2339010764730).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1451306034630 is a wasteful number, since it uses less digits than its factorization.
1451306034630 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72312445 (or 72312442 counting only the distinct ones).
The product of its (nonzero) digits is 77760, while the sum is 36.
The spelling of 1451306034630 in words is "one trillion, four hundred fifty-one billion, three hundred six million, thirty-four thousand, six hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •