Base | Representation |
---|---|
bin | 11110100011110001110… |
… | …11111100100000000010 |
3 | 10201101020101010102110121 |
4 | 33101320323330200002 |
5 | 114200400224003300 |
6 | 2122210325250454 |
7 | 135601001146363 |
oct | 17217073744002 |
9 | 3641211112417 |
10 | 1050001000450 |
11 | 375337211666 |
12 | 14b5b7263a2a |
13 | 780262c8a3c |
14 | 38b6ad57b6a |
15 | 1c4a625781a |
hex | f478efc802 |
1050001000450 has 96 divisors (see below), whose sum is σ = 2150581104000. Its totient is φ = 379857139200.
The previous prime is 1050001000439. The next prime is 1050001000471. The reversal of 1050001000450 is 540001000501.
It is a happy number.
1050001000450 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×10500010004502 (a number of 25 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2237835 + ... + 2666065.
It is an arithmetic number, because the mean of its divisors is an integer number (22401886500).
Almost surely, 21050001000450 is an apocalyptic number.
1050001000450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1050001000450 is an abundant number, since it is smaller than the sum of its proper divisors (1100580103550).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1050001000450 is a wasteful number, since it uses less digits than its factorization.
1050001000450 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 428380 (or 428375 counting only the distinct ones).
The product of its (nonzero) digits is 100, while the sum is 16.
Adding to 1050001000450 its reverse (540001000501), we get a palindrome (1590002000951).
The spelling of 1050001000450 in words is "one trillion, fifty billion, one million, four hundred fifty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •