Base | Representation |
---|---|
bin | 1000111001111110000… |
… | …10100100001001111001 |
3 | 1002020211200120121112001 |
4 | 10130333002210021321 |
5 | 20003142040040001 |
6 | 352324040421001 |
7 | 31051654522153 |
oct | 4347702441171 |
9 | 1066750517461 |
10 | 306000315001 |
11 | 108857222817 |
12 | 4b37aa77761 |
13 | 22b17ca7b64 |
14 | 10b4bdd3ad3 |
15 | 7e5e35a001 |
hex | 473f0a4279 |
306000315001 has 16 divisors (see below), whose sum is σ = 310881400000. Its totient is φ = 301138725888.
The previous prime is 306000314947. The next prime is 306000315007. The reversal of 306000315001 is 100513000603.
It is a cyclic number.
It is not a de Polignac number, because 306000315001 - 215 = 306000282233 is a prime.
It is a super-2 number, since 2×3060003150012 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 306000315001.
It is not an unprimeable number, because it can be changed into a prime (306000315007) 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 15 ways as a sum of consecutive naturals, for example, 78319090 + ... + 78322996.
It is an arithmetic number, because the mean of its divisors is an integer number (19430087500).
Almost surely, 2306000315001 is an apocalyptic number.
It is an amenable number.
306000315001 is a deficient number, since it is larger than the sum of its proper divisors (4881084999).
306000315001 is a wasteful number, since it uses less digits than its factorization.
306000315001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6088.
The product of its (nonzero) digits is 270, while the sum is 19.
Adding to 306000315001 its reverse (100513000603), we get a palindrome (406513315604).
The spelling of 306000315001 in words is "three hundred six billion, three hundred fifteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •