Base | Representation |
---|---|
bin | 1000110010100010101… |
… | …00011001101010100111 |
3 | 1001212112201212220000101 |
4 | 10121101110121222213 |
5 | 14422010033410343 |
6 | 350424205324531 |
7 | 30551065520164 |
oct | 4312124315247 |
9 | 1055481786011 |
10 | 302012013223 |
11 | 10709a9a9648 |
12 | 4a647266747 |
13 | 22630920c8b |
14 | 1089044706b |
15 | 7cc9145e4d |
hex | 4651519aa7 |
302012013223 has 16 divisors (see below), whose sum is σ = 323404704000. Its totient is φ = 281207564352.
The previous prime is 302012013209. The next prime is 302012013241. The reversal of 302012013223 is 322310210203.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-302012013223 is a prime.
It is a super-2 number, since 2×3020120132232 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
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 302012013223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (302012013923) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 252333 + ... + 817126.
It is an arithmetic number, because the mean of its divisors is an integer number (20212794000).
Almost surely, 2302012013223 is an apocalyptic number.
302012013223 is a deficient number, since it is larger than the sum of its proper divisors (21392690777).
302012013223 is a wasteful number, since it uses less digits than its factorization.
302012013223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1069734.
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 302012013223 its reverse (322310210203), we get a palindrome (624322223426).
The spelling of 302012013223 in words is "three hundred two billion, twelve million, thirteen thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •