Base | Representation |
---|---|
bin | 100010110011111111110101… |
… | …0101001100000000010100001 |
3 | 1111011012201220101020110100220 |
4 | 1011213333222221200002201 |
5 | 310114001003302203001 |
6 | 3003132333310033253 |
7 | 121333130133142626 |
oct | 10547775251400241 |
9 | 1434181811213326 |
10 | 306213630116001 |
11 | 89629520255a53 |
12 | 2a4163051a8829 |
13 | 101b2a8a86707a |
14 | 5588b66a1834d |
15 | 25604bc688c36 |
hex | 1167feaa600a1 |
306213630116001 has 8 divisors (see below), whose sum is σ = 408314338428384. Its totient is φ = 204127670940480.
The previous prime is 306213630115961. The next prime is 306213630116099. The reversal of 306213630116001 is 100611036312603.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 306213630116001 - 29 = 306213630115489 is a prime.
It is not an unprimeable number, because it can be changed into a prime (306213630116501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3687235771 + ... + 3687318816.
It is an arithmetic number, because the mean of its divisors is an integer number (51039292303548).
Almost surely, 2306213630116001 is an apocalyptic number.
It is an amenable number.
306213630116001 is a deficient number, since it is larger than the sum of its proper divisors (102100708312383).
306213630116001 is a wasteful number, since it uses less digits than its factorization.
306213630116001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7374568431.
The product of its (nonzero) digits is 11664, while the sum is 33.
Adding to 306213630116001 its reverse (100611036312603), we get a palindrome (406824666428604).
The spelling of 306213630116001 in words is "three hundred six trillion, two hundred thirteen billion, six hundred thirty million, one hundred sixteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •