Base | Representation |
---|---|
bin | 1100111011011100010… |
… | …11110001010111000100 |
3 | 1120110122011111220002020 |
4 | 12131232023301113010 |
5 | 24234240413223022 |
6 | 540024311043140 |
7 | 44044303330350 |
oct | 6355613612704 |
9 | 1513564456066 |
10 | 444230211012 |
11 | 1614404115a5 |
12 | 721179704b0 |
13 | 32b76c16633 |
14 | 177024cc460 |
15 | b84e97b35c |
hex | 676e2f15c4 |
444230211012 has 72 divisors (see below), whose sum is σ = 1199800236096. Its totient is φ = 125316150336.
The previous prime is 444230210959. The next prime is 444230211043. The reversal of 444230211012 is 210112032444.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 100558 + ... + 947930.
It is an arithmetic number, because the mean of its divisors is an integer number (16663892168).
Almost surely, 2444230211012 is an apocalyptic number.
444230211012 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 444230211012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (599900118048).
444230211012 is an abundant number, since it is smaller than the sum of its proper divisors (755570025084).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
444230211012 is a wasteful number, since it uses less digits than its factorization.
444230211012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 847545 (or 847464 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 24.
Adding to 444230211012 its reverse (210112032444), we get a palindrome (654342243456).
The spelling of 444230211012 in words is "four hundred forty-four billion, two hundred thirty million, two hundred eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.121 sec. • engine limits •