Base | Representation |
---|---|
bin | 100010101011010000010101… |
… | …1001100000001100011110110 |
3 | 1110222221212121012212102111221 |
4 | 1011112200223030001203312 |
5 | 304434304311222041032 |
6 | 3000412345014420554 |
7 | 121150253503211062 |
oct | 10526405314014366 |
9 | 1428855535772457 |
10 | 305012122065142 |
11 | 89205a0728aa38 |
12 | 2a26148666175a |
13 | 1012669a9cb79b |
14 | 55469460d2aa2 |
15 | 253e0ea3b3597 |
hex | 115682b3018f6 |
305012122065142 has 4 divisors (see below), whose sum is σ = 457518183097716. Its totient is φ = 152506061032570.
The previous prime is 305012122065103. The next prime is 305012122065181. The reversal of 305012122065142 is 241560221210503.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (305012122065103) and next prime (305012122065181).
It is a junction number, because it is equal to n+sod(n) for n = 305012122065098 and 305012122065107.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 76253030516284 + ... + 76253030516287.
It is an arithmetic number, because the mean of its divisors is an integer number (114379545774429).
Almost surely, 2305012122065142 is an apocalyptic number.
305012122065142 is a deficient number, since it is larger than the sum of its proper divisors (152506061032574).
305012122065142 is a wasteful number, since it uses less digits than its factorization.
305012122065142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 152506061032573.
The product of its (nonzero) digits is 28800, while the sum is 34.
Adding to 305012122065142 its reverse (241560221210503), we get a palindrome (546572343275645).
The spelling of 305012122065142 in words is "three hundred five trillion, twelve billion, one hundred twenty-two million, sixty-five thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •