Base | Representation |
---|---|
bin | 10010010011111… |
… | …010111110110101 |
3 | 210102001222221010 |
4 | 102103322332311 |
5 | 1112121242323 |
6 | 50252342433 |
7 | 10420155300 |
oct | 2223727665 |
9 | 712058833 |
10 | 307212213 |
11 | 1484600a0 |
12 | 86a74a19 |
13 | 4b854799 |
14 | 2cb2db37 |
15 | 1be85c93 |
hex | 124fafb5 |
307212213 has 24 divisors (see below), whose sum is σ = 519812640. Its totient is φ = 159589920.
The previous prime is 307212211. The next prime is 307212271. The reversal of 307212213 is 312212703.
It is not a de Polignac number, because 307212213 - 21 = 307212211 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 307212213.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (307212211) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 93378 + ... + 96611.
It is an arithmetic number, because the mean of its divisors is an integer number (21658860).
Almost surely, 2307212213 is an apocalyptic number.
307212213 is a gapful number since it is divisible by the number (33) formed by its first and last digit.
It is an amenable number.
307212213 is a deficient number, since it is larger than the sum of its proper divisors (212600427).
307212213 is a wasteful number, since it uses less digits than its factorization.
307212213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 190017 (or 190010 counting only the distinct ones).
The product of its (nonzero) digits is 504, while the sum is 21.
The square root of 307212213 is about 17527.4702395982. The cubic root of 307212213 is about 674.7550738270.
Adding to 307212213 its reverse (312212703), we get a palindrome (619424916).
The spelling of 307212213 in words is "three hundred seven million, two hundred twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •