Base | Representation |
---|---|
bin | 1000000000010010001… |
… | …01011101011010000010 |
3 | 222021220100002112001210 |
4 | 10000021011131122002 |
5 | 14001230231124213 |
6 | 330202554310550 |
7 | 25604336154465 |
oct | 4001105353202 |
9 | 867810075053 |
10 | 275030333058 |
11 | a67044a8a18 |
12 | 45377128456 |
13 | 1cc20985b60 |
14 | d450c132dc |
15 | 724a4ce0c3 |
hex | 400915d682 |
275030333058 has 64 divisors (see below), whose sum is σ = 606576015360. Its totient is φ = 82605241152.
The previous prime is 275030333047. The next prime is 275030333117. The reversal of 275030333058 is 850333030572.
It is a happy number.
It is a super-3 number, since 3×2750303330583 (a number of 35 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 1290441 + ... + 1488387.
It is an arithmetic number, because the mean of its divisors is an integer number (9477750240).
Almost surely, 2275030333058 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 275030333058, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (303288007680).
275030333058 is an abundant number, since it is smaller than the sum of its proper divisors (331545682302).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
275030333058 is a wasteful number, since it uses less digits than its factorization.
275030333058 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 198391.
The product of its (nonzero) digits is 226800, while the sum is 39.
The spelling of 275030333058 in words is "two hundred seventy-five billion, thirty million, three hundred thirty-three thousand, fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •