Base | Representation |
---|---|
bin | 10100111100010100000110… |
… | …11101001110100111100111 |
3 | 20001001121102221022211011210 |
4 | 22132022003131032213213 |
5 | 22014012211233400223 |
6 | 241540215043202503 |
7 | 12462131266131246 |
oct | 1236120335164747 |
9 | 201047387284153 |
10 | 46052844825063 |
11 | 137459a134376a |
12 | 51b9424676433 |
13 | 1c909c2b8a2cb |
14 | b52d8076a95d |
15 | 54ce1818a893 |
hex | 29e28374e9e7 |
46052844825063 has 8 divisors (see below), whose sum is σ = 61413622450048. Its totient is φ = 30696981875064.
The previous prime is 46052844824981. The next prime is 46052844825101. The reversal of 46052844825063 is 36052844825064.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 46052844825063 - 218 = 46052844562919 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 46052844824994 and 46052844825012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (46052844825763) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1228646881 + ... + 1228684362.
It is an arithmetic number, because the mean of its divisors is an integer number (7676702806256).
Almost surely, 246052844825063 is an apocalyptic number.
46052844825063 is a deficient number, since it is larger than the sum of its proper divisors (15360777624985).
46052844825063 is a wasteful number, since it uses less digits than its factorization.
46052844825063 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2457337493.
The product of its (nonzero) digits is 44236800, while the sum is 57.
Subtracting from 46052844825063 its reverse (36052844825064), we obtain a palindrome (9999999999999).
The spelling of 46052844825063 in words is "forty-six trillion, fifty-two billion, eight hundred forty-four million, eight hundred twenty-five thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •