Base | Representation |
---|---|
bin | 11110101111000100010… |
… | …01011010001110000110 |
3 | 10201221212201021122010101 |
4 | 33113202021122032012 |
5 | 114300303120330110 |
6 | 2125051530314314 |
7 | 136204115165641 |
oct | 17274211321606 |
9 | 3657781248111 |
10 | 1056061105030 |
11 | 377966a64958 |
12 | 15080888899a |
13 | 7878097a239 |
14 | 39183b30a58 |
15 | 1c70d2b413a |
hex | f5e225a386 |
1056061105030 has 8 divisors (see below), whose sum is σ = 1900909989072. Its totient is φ = 422424442008.
The previous prime is 1056061104949. The next prime is 1056061105051. The reversal of 1056061105030 is 305011606501.
1056061105030 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×10560611050303 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 1056061105030.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 52803055242 + ... + 52803055261.
It is an arithmetic number, because the mean of its divisors is an integer number (237613748634).
Almost surely, 21056061105030 is an apocalyptic number.
1056061105030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1056061105030 is a deficient number, since it is larger than the sum of its proper divisors (844848884042).
1056061105030 is a wasteful number, since it uses less digits than its factorization.
1056061105030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 105606110510.
The product of its (nonzero) digits is 2700, while the sum is 28.
The spelling of 1056061105030 in words is "one trillion, fifty-six billion, sixty-one million, one hundred five thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •