Base | Representation |
---|---|
bin | 11010111100010… |
… | …010110100011101 |
3 | 1011111112122201212 |
4 | 122330102310131 |
5 | 1411203411331 |
6 | 112504114205 |
7 | 14126023103 |
oct | 3274226435 |
9 | 1144478655 |
10 | 452013341 |
11 | 21217134a |
12 | 107465965 |
13 | 72853220 |
14 | 44063c73 |
15 | 29a39d2b |
hex | 1af12d1d |
452013341 has 4 divisors (see below), whose sum is σ = 486783612. Its totient is φ = 417243072.
The previous prime is 452013313. The next prime is 452013361. The reversal of 452013341 is 143310254.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 143310254 = 2 ⋅71655127.
It can be written as a sum of positive squares in 2 ways, for example, as 207216025 + 244797316 = 14395^2 + 15646^2 .
It is a cyclic number.
It is not a de Polignac number, because 452013341 - 226 = 384904477 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (452013361) 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, 17385116 + ... + 17385141.
It is an arithmetic number, because the mean of its divisors is an integer number (121695903).
Almost surely, 2452013341 is an apocalyptic number.
It is an amenable number.
452013341 is a deficient number, since it is larger than the sum of its proper divisors (34770271).
452013341 is a wasteful number, since it uses less digits than its factorization.
452013341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34770270.
The product of its (nonzero) digits is 1440, while the sum is 23.
The square root of 452013341 is about 21260.6053770818. The cubic root of 452013341 is about 767.4505782915.
Adding to 452013341 its reverse (143310254), we get a palindrome (595323595).
The spelling of 452013341 in words is "four hundred fifty-two million, thirteen thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.168 sec. • engine limits •