Base | Representation |
---|---|
bin | 11101110101101001100… |
… | …10101110010000100000 |
3 | 10122000022102022011211221 |
4 | 32322310302232100200 |
5 | 113244140231141000 |
6 | 2102553040544424 |
7 | 134033201133532 |
oct | 16726462562040 |
9 | 3560272264757 |
10 | 1025235412000 |
11 | 365888731498 |
12 | 146845322114 |
13 | 758aa5077a7 |
14 | 3789bb8d852 |
15 | 1ba06e3a61a |
hex | eeb4cae420 |
1025235412000 has 96 divisors (see below), whose sum is σ = 2577585314304. Its totient is φ = 400557024000.
The previous prime is 1025235411983. The next prime is 1025235412063. The reversal of 1025235412000 is 2145325201.
It is a super-2 number, since 2×10252354120002 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2808336 + ... + 3152335.
It is an arithmetic number, because the mean of its divisors is an integer number (26849847024).
Almost surely, 21025235412000 is an apocalyptic number.
1025235412000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1025235412000 is an abundant number, since it is smaller than the sum of its proper divisors (1552349902304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1025235412000 is an equidigital number, since it uses as much as digits as its factorization.
1025235412000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5960739 (or 5960721 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 25.
The spelling of 1025235412000 in words is "one trillion, twenty-five billion, two hundred thirty-five million, four hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •