Base | Representation |
---|---|
bin | 1111110111001010101… |
… | …00011010000001011110 |
3 | 1221002202220111202201000 |
4 | 13323211110122001132 |
5 | 32412141340224410 |
6 | 1054213044331130 |
7 | 54242635600335 |
oct | 7734524320136 |
9 | 1832686452630 |
10 | 545013211230 |
11 | 1a0158827314 |
12 | 897639a3aa6 |
13 | 3c518a062c7 |
14 | 1c543530d1c |
15 | e29c7d0dc0 |
hex | 7ee551a05e |
545013211230 has 128 divisors (see below), whose sum is σ = 1540799631360. Its totient is φ = 136847180160.
The previous prime is 545013211217. The next prime is 545013211241. The reversal of 545013211230 is 32112310545.
545013211230 is a `hidden beast` number, since 5 + 4 + 501 + 32 + 1 + 123 + 0 = 666.
It is a super-2 number, since 2×5450132112302 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 545013211194 and 545013211203.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 570244 + ... + 1189623.
It is an arithmetic number, because the mean of its divisors is an integer number (12037497120).
Almost surely, 2545013211230 is an apocalyptic number.
545013211230 is an abundant number, since it is smaller than the sum of its proper divisors (995786420130).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
545013211230 is a wasteful number, since it uses less digits than its factorization.
545013211230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1759951 (or 1759945 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
Adding to 545013211230 its reverse (32112310545), we get a palindrome (577125521775).
The spelling of 545013211230 in words is "five hundred forty-five billion, thirteen million, two hundred eleven thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •