Base | Representation |
---|---|
bin | 110011001010111110110011… |
… | …0101110000011001000101001 |
3 | 2012000201002120212201012202212 |
4 | 1212111331212232003020221 |
5 | 432444100240224013001 |
6 | 4233145402503334505 |
7 | 163544242266423335 |
oct | 14625754656031051 |
9 | 2160632525635685 |
10 | 450110001001001 |
11 | 120467641248970 |
12 | 42596400751435 |
13 | 1642026372b423 |
14 | 7d216242167c5 |
15 | 37085d9ed27bb |
hex | 1995f66b83229 |
450110001001001 has 16 divisors (see below), whose sum is σ = 491984319946560. Its totient is φ = 408395322118080.
The previous prime is 450110001000973. The next prime is 450110001001007. The reversal of 450110001001001 is 100100100011054.
It is not a de Polignac number, because 450110001001001 - 214 = 450110000984617 is a prime.
It is a super-2 number, since 2×4501100010010012 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
450110001001001 is a modest number, since divided by 1001001 gives 450110 as remainder.
It is not an unprimeable number, because it can be changed into a prime (450110001001007) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9795635 + ... + 31562231.
It is an arithmetic number, because the mean of its divisors is an integer number (30749019996660).
Almost surely, 2450110001001001 is an apocalyptic number.
It is an amenable number.
450110001001001 is a deficient number, since it is larger than the sum of its proper divisors (41874318945559).
450110001001001 is a wasteful number, since it uses less digits than its factorization.
450110001001001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21770264.
The product of its (nonzero) digits is 20, while the sum is 14.
Adding to 450110001001001 its reverse (100100100011054), we get a palindrome (550210101012055).
The spelling of 450110001001001 in words is "four hundred fifty trillion, one hundred ten billion, one million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •