Base | Representation |
---|---|
bin | 1101101010101001110101… |
… | …01000011011010100000001 |
3 | 10221102000201011122020002200 |
4 | 12311110322220123110001 |
5 | 12414341234140040043 |
6 | 143530033043303413 |
7 | 6221151062563551 |
oct | 665247250332401 |
9 | 127360634566080 |
10 | 30052869846273 |
11 | 963739460808a |
12 | 345454537ab69 |
13 | 139cc86922a61 |
14 | 75c7d0cc3161 |
15 | 371b265a37d3 |
hex | 1b553aa1b501 |
30052869846273 has 24 divisors (see below), whose sum is σ = 43431269481600. Its totient is φ = 20025292963104.
The previous prime is 30052869846229. The next prime is 30052869846353. The reversal of 30052869846273 is 37264896825003.
It is a happy number.
30052869846273 is a `hidden beast` number, since 3 + 0 + 0 + 5 + 2 + 86 + 98 + 462 + 7 + 3 = 666.
It is not a de Polignac number, because 30052869846273 - 28 = 30052869846017 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 30052869846273.
It is not an unprimeable number, because it can be changed into a prime (30052869846203) 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, 416560638 + ... + 416632776.
It is an arithmetic number, because the mean of its divisors is an integer number (1809636228400).
Almost surely, 230052869846273 is an apocalyptic number.
It is an amenable number.
30052869846273 is a deficient number, since it is larger than the sum of its proper divisors (13378399635327).
30052869846273 is a wasteful number, since it uses less digits than its factorization.
30052869846273 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94501 (or 94498 counting only the distinct ones).
The product of its (nonzero) digits is 104509440, while the sum is 63.
The spelling of 30052869846273 in words is "thirty trillion, fifty-two billion, eight hundred sixty-nine million, eight hundred forty-six thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •