Search a number
-
+
46520036013 = 3113145474131
BaseRepresentation
bin101011010100110011…
…110110101010101101
311110002001122200110210
4223110303312222231
51230233112123023
633212045453033
73234544532103
oct532463665255
9143061580423
1046520036013
1118802390660
129023571179
134504aca039
1423744a9c73
1513240e4593
hexad4cf6aad

46520036013 has 16 divisors (see below), whose sum is σ = 69848266752. Its totient is φ = 27284478000.

The previous prime is 46520036011. The next prime is 46520036023. The reversal of 46520036013 is 31063002564.

It is not a de Polignac number, because 46520036013 - 21 = 46520036011 is a prime.

It is a super-2 number, since 2×465200360132 (a number of 22 digits) contains 22 as substring.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (46520036011) 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, 22736043 + ... + 22738088.

It is an arithmetic number, because the mean of its divisors is an integer number (4365516672).

Almost surely, 246520036013 is an apocalyptic number.

It is an amenable number.

46520036013 is a deficient number, since it is larger than the sum of its proper divisors (23328230739).

46520036013 is a wasteful number, since it uses less digits than its factorization.

46520036013 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 45474176.

The product of its (nonzero) digits is 12960, while the sum is 30.

Adding to 46520036013 its reverse (31063002564), we get a palindrome (77583038577).

The spelling of 46520036013 in words is "forty-six billion, five hundred twenty million, thirty-six thousand, thirteen".

Divisors: 1 3 11 31 33 93 341 1023 45474131 136422393 500215441 1409698061 1500646323 4229094183 15506678671 46520036013