Base | Representation |
---|---|
bin | 1000111000001000010… |
… | …00100111010110101111 |
3 | 1002011021210222022020222 |
4 | 10130010020213112233 |
5 | 14444131040421411 |
6 | 352042014401555 |
7 | 31015324415165 |
oct | 4340410472657 |
9 | 1064253868228 |
10 | 305012045231 |
11 | 10839a391043 |
12 | 4b143b002bb |
13 | 229bb316c4a |
14 | 10a96a5b235 |
15 | 7e026e44db |
hex | 47042275af |
305012045231 has 4 divisors (see below), whose sum is σ = 305018481864. Its totient is φ = 305005608600.
The previous prime is 305012045189. The next prime is 305012045269. The reversal of 305012045231 is 132540210503.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 305012045231 - 26 = 305012045167 is a prime.
It is a super-2 number, since 2×3050120452312 (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 305012045231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (305012045281) 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, 3146705 + ... + 3242186.
It is an arithmetic number, because the mean of its divisors is an integer number (76254620466).
Almost surely, 2305012045231 is an apocalyptic number.
305012045231 is a deficient number, since it is larger than the sum of its proper divisors (6436633).
305012045231 is an equidigital number, since it uses as much as digits as its factorization.
305012045231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6436632.
The product of its (nonzero) digits is 3600, while the sum is 26.
Adding to 305012045231 its reverse (132540210503), we get a palindrome (437552255734).
The spelling of 305012045231 in words is "three hundred five billion, twelve million, forty-five thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •