Base | Representation |
---|---|
bin | 110010101111010111101110… |
… | …1010110000110010001101010 |
3 | 2011112021022122110122002111020 |
4 | 1211132233131112012101222 |
5 | 431444412102432341300 |
6 | 4221122220224113310 |
7 | 163003132500231660 |
oct | 14536573526062152 |
9 | 2145238573562436 |
10 | 446315240121450 |
11 | 11a2342596a8207 |
12 | 42082a72a65836 |
13 | 162064674b413b |
14 | 7c2dab6b02c30 |
15 | 368ea3c3d88a0 |
hex | 195ebdd58646a |
446315240121450 has 192 divisors, whose sum is σ = 1284041845585920. Its totient is φ = 100478481143040.
The previous prime is 446315240121347. The next prime is 446315240121523. The reversal of 446315240121450 is 54121042513644.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 515443971 + ... + 516309129.
It is an arithmetic number, because the mean of its divisors is an integer number (6687717945760).
Almost surely, 2446315240121450 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 446315240121450, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (642020922792960).
446315240121450 is an abundant number, since it is smaller than the sum of its proper divisors (837726605464470).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
446315240121450 is a wasteful number, since it uses less digits than its factorization.
446315240121450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 872581 (or 872576 counting only the distinct ones).
The product of its (nonzero) digits is 460800, while the sum is 42.
The spelling of 446315240121450 in words is "four hundred forty-six trillion, three hundred fifteen billion, two hundred forty million, one hundred twenty-one thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •