Base | Representation |
---|---|
bin | 111110111001101… |
… | …001110110010100 |
3 | 2201112201211211200 |
4 | 332321221312110 |
5 | 4130124113022 |
6 | 252414432500 |
7 | 35102624223 |
oct | 7671516624 |
9 | 2645654750 |
10 | 1055301012 |
11 | 4a17652a7 |
12 | 255502730 |
13 | 13a83038c |
14 | a0224cba |
15 | 629a6bac |
hex | 3ee69d94 |
1055301012 has 36 divisors (see below), whose sum is σ = 2729606880. Its totient is φ = 343585872.
The previous prime is 1055301001. The next prime is 1055301029. The reversal of 1055301012 is 2101035501.
1055301012 is a `hidden beast` number, since 10 + 553 + 0 + 101 + 2 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is a super-2 number, since 2×10553010122 = 2227320451856448288, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 339312 + ... + 342407.
Almost surely, 21055301012 is an apocalyptic number.
1055301012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1055301012 is an abundant number, since it is smaller than the sum of its proper divisors (1674305868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1055301012 is a wasteful number, since it uses less digits than its factorization.
1055301012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 681772 (or 681767 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 18.
The square root of 1055301012 is about 32485.3969038397. The cubic root of 1055301012 is about 1018.1039401464.
Adding to 1055301012 its reverse (2101035501), we get a palindrome (3156336513).
The spelling of 1055301012 in words is "one billion, fifty-five million, three hundred one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •