Base | Representation |
---|---|
bin | 1101110111010001011010… |
… | …01101000101101101101001 |
3 | 10222221110211011100202012102 |
4 | 12323220231031011231221 |
5 | 12443442210141214001 |
6 | 144501135300423145 |
7 | 6264400211445152 |
oct | 673505515055551 |
9 | 128843734322172 |
10 | 30486436273001 |
11 | 9794252550715 |
12 | 35045859a7ab5 |
13 | 1401b2147ca57 |
14 | 7757a1020929 |
15 | 37d04ec54e6b |
hex | 1bba2d345b69 |
30486436273001 has 4 divisors (see below), whose sum is σ = 30486706227600. Its totient is φ = 30486166318404.
The previous prime is 30486436272961. The next prime is 30486436273009. The reversal of 30486436273001 is 10037263468403.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30486436273001 is a prime.
It is a super-2 number, since 2×304864362730012 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (30486436273009) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 134807831 + ... + 135033788.
It is an arithmetic number, because the mean of its divisors is an integer number (7621676556900).
Almost surely, 230486436273001 is an apocalyptic number.
It is an amenable number.
30486436273001 is a deficient number, since it is larger than the sum of its proper divisors (269954599).
30486436273001 is a wasteful number, since it uses less digits than its factorization.
30486436273001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 269954598.
The product of its (nonzero) digits is 1741824, while the sum is 47.
The spelling of 30486436273001 in words is "thirty trillion, four hundred eighty-six billion, four hundred thirty-six million, two hundred seventy-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •