Base | Representation |
---|---|
bin | 1110000011110101001… |
… | …01111110011001010001 |
3 | 1201011221120220211112100 |
4 | 13001322211332121101 |
5 | 30403333314044101 |
6 | 1005532505551013 |
7 | 46621332463014 |
oct | 7017245763121 |
9 | 1634846824470 |
10 | 483093112401 |
11 | 176973516619 |
12 | 79762aa5469 |
13 | 3672b529183 |
14 | 1954ba6137b |
15 | c8766eee86 |
hex | 707a97e651 |
483093112401 has 27 divisors (see below), whose sum is σ = 702052472667. Its totient is φ = 320111767440.
The previous prime is 483093112393. The next prime is 483093112429. The reversal of 483093112401 is 104211390384.
The square root of 483093112401 is 695049.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 19707948225 + 463385164176 = 140385^2 + 680724^2 .
It is not a de Polignac number, because 483093112401 - 23 = 483093112393 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (483093111401) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 398262471 + ... + 398263683.
Almost surely, 2483093112401 is an apocalyptic number.
483093112401 is the 695049-th square number.
483093112401 is the 347525-th centered octagonal number.
It is an amenable number.
483093112401 is a deficient number, since it is larger than the sum of its proper divisors (218959360266).
483093112401 is an frugal number, since it uses more digits than its factorization.
483093112401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2814 (or 1407 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 36.
Multiplying 483093112401 by its sum of digits (36), we get a square (17391352046436 = 41702942).
The spelling of 483093112401 in words is "four hundred eighty-three billion, ninety-three million, one hundred twelve thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •