Base | Representation |
---|---|
bin | 11100001110111011… |
… | …010110110100001101 |
3 | 2220020201102100000022 |
4 | 130032323112310031 |
5 | 444041143241140 |
6 | 21532052111525 |
7 | 2122145023256 |
oct | 341673266415 |
9 | 86221370008 |
10 | 30315212045 |
11 | 11947168558 |
12 | 5a606055a5 |
13 | 2b2178abc1 |
14 | 167825bb2d |
15 | bc66400b5 |
hex | 70eed6d0d |
30315212045 has 4 divisors (see below), whose sum is σ = 36378254460. Its totient is φ = 24252169632.
The previous prime is 30315212003. The next prime is 30315212047. The reversal of 30315212045 is 54021251303.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 54021251303 = 37 ⋅1460033819.
It can be written as a sum of positive squares in 2 ways, for example, as 3856285801 + 26458926244 = 62099^2 + 162662^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-30315212045 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (30315212047) 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, 3031521200 + ... + 3031521209.
It is an arithmetic number, because the mean of its divisors is an integer number (9094563615).
Almost surely, 230315212045 is an apocalyptic number.
It is an amenable number.
30315212045 is a deficient number, since it is larger than the sum of its proper divisors (6063042415).
30315212045 is an equidigital number, since it uses as much as digits as its factorization.
30315212045 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6063042414.
The product of its (nonzero) digits is 3600, while the sum is 26.
Adding to 30315212045 its reverse (54021251303), we get a palindrome (84336463348).
The spelling of 30315212045 in words is "thirty billion, three hundred fifteen million, two hundred twelve thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •