Base | Representation |
---|---|
bin | 11011011111000… |
… | …100100100110001 |
3 | 1012010200211111010 |
4 | 123133010210301 |
5 | 1421022130113 |
6 | 113431341133 |
7 | 14266353300 |
oct | 3337044461 |
9 | 1163624433 |
10 | 461130033 |
11 | 217328901 |
12 | 10a5217a9 |
13 | 746c5a10 |
14 | 45358437 |
15 | 2a73b1c3 |
hex | 1b7c4931 |
461130033 has 24 divisors (see below), whose sum is σ = 770242368. Its totient is φ = 243232416.
The previous prime is 461130029. The next prime is 461130037. The reversal of 461130033 is 330031164.
It is an interprime number because it is at equal distance from previous prime (461130029) and next prime (461130037).
It is not a de Polignac number, because 461130033 - 22 = 461130029 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 461129991 and 461130009.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (461130037) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 118741 + ... + 122562.
It is an arithmetic number, because the mean of its divisors is an integer number (32093432).
Almost surely, 2461130033 is an apocalyptic number.
It is an amenable number.
461130033 is a deficient number, since it is larger than the sum of its proper divisors (309112335).
461130033 is a wasteful number, since it uses less digits than its factorization.
461130033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 241333 (or 241326 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
The square root of 461130033 is about 21473.9384603756. The cubic root of 461130033 is about 772.5758637700.
Adding to 461130033 its reverse (330031164), we get a palindrome (791161197).
The spelling of 461130033 in words is "four hundred sixty-one million, one hundred thirty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •